Genetic Programming with Adaptive Population Restructuring for Dynamic Flexible Job Shop Scheduling

Source abstract

In the dynamic flexible job shop scheduling problem (DFJSP) where the environment changes irregularly, priority rules are used to calculate priorities for each job and machine, determining the processing order. To achieve efficient scheduling, it is necessary to select appropriate priority rules that match the problem’s characteristics whenever the environment changes. To address such problems, Genetic Programming (GP) has been proposed to derive mathematically expressed priority rules. Various GP-based methods exist, among which Population-based Fluctuation GP (PF-GP) is an efficient technique that reuses individuals adapted to problem characteristics. However, optimizing the DFJSP using PF-GP requires significant computational cost. Therefore, methods have been developed to adaptively change the population size for more efficient resource utilization. This paper modifies the adaptive population size change into a population growth method designed to balance scheduling performance and computational efficiency in the DFJSP. By applying this proposed method to various scheduling problems, this paper investigates its effectiveness. Furthermore, this paper compares population growth methods and demonstrates that the proposed method addresses conventional issues in existing population adjustment techniques, enabling the more efficient utilization of computational resources.