Optimizing Dynamic Flexible Job Shop Scheduling Using an Evolutionary Multitask Optimization Framework and Genetic Programming

Driven by the evolution of smart and sustainable manufacturing paradigms under Industry 5.0, which emphasize adaptability, connectivity, and data-driven decision-making, the dynamic flexible job shop scheduling problem (DFJSSP) has emerged as a critical area of research. The DFJSSP involves scheduling jobs in a highly dynamic and uncertain manufacturing environment where new tasks are continually introduced, further complicating the scheduling process. In this study, the DFJSSP is extended to incorporate single crane transportation and sequence-dependent setup times, reflecting real-world manufacturing constraints. To tackle this multifaceted problem, we introduce a novel approach, i.e., a multipopulation-based evolutionary multitask optimization (EMTO) framework. In addition, the genetic programming algorithm is employed as a generative hyperheuristic to deal with the dynamic uncertainties in the shop floor. Two components are collaborated to optimize two objectives, i.e., minimizing the maximum completion time and the total tardiness. Furthermore, a dynamic transfer ratio is proposed, allowing the proportion of knowledge transfer to adapt throughout the iteration process, balancing convergence speed with population diversity. The results demonstrate that both the EMTO framework and the dynamic transfer ratio significantly enhance the performance of the algorithm. Compared to well-known constructive heuristics and reinforcement learning algorithm, the proposed approach enables parallel resolution of multiple optimization objectives, leading to enhanced scheduling efficiency and adaptability in dynamic manufacturing environments.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Evolutionary Computation
Published
2025-02-20
DOI
https://doi.org/10.1109/tevc.2025.3543770
Citations
30
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
37.27

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Dynamic Flexible Job Shop Scheduling Using an Evolutionary Multitask Optimization Framework and Genetic Programming

Zunxun Wang, Qingda Chen, Kaizhou Gao, Quan-Ke Pan et al.
30 citations
IEEE Transactions on Evolutionary Computation
Scheduling and Optimization Algorithms
37.27
article

Optimizing Dynamic Flexible Job Shop Scheduling Using an Evolutionary Multitask Optimization Framework and Genetic Programming

Zunxun Wang, Qingda Chen, Kaizhou Gao, Quan-Ke Pan, Xiaolong Chen, Junqiang Li
article en
30 citations

Abstract

Driven by the evolution of smart and sustainable manufacturing paradigms under Industry 5.0, which emphasize adaptability, connectivity, and data-driven decision-making, the dynamic flexible job shop scheduling problem (DFJSSP) has emerged as a critical area of research. The DFJSSP involves scheduling jobs in a highly dynamic and uncertain manufacturing environment where new tasks are continually introduced, further complicating the scheduling process. In this study, the DFJSSP is extended to incorporate single crane transportation and sequence-dependent setup times, reflecting real-world manufacturing constraints. To tackle this multifaceted problem, we introduce a novel approach, i.e., a multipopulation-based evolutionary multitask optimization (EMTO) framework. In addition, the genetic programming algorithm is employed as a generative hyperheuristic to deal with the dynamic uncertainties in the shop floor. Two components are collaborated to optimize two objectives, i.e., minimizing the maximum completion time and the total tardiness. Furthermore, a dynamic transfer ratio is proposed, allowing the proportion of knowledge transfer to adapt throughout the iteration process, balancing convergence speed with population diversity. The results demonstrate that both the EMTO framework and the dynamic transfer ratio significantly enhance the performance of the algorithm. Compared to well-known constructive heuristics and reinforcement learning algorithm, the proposed approach enables parallel resolution of multiple optimization objectives, leading to enhanced scheduling efficiency and adaptability in dynamic manufacturing environments.

IEEE Transactions on Evolutionary ComputationVol. 29(5)
Macau University of Science and Technology (MO), Shanghai University (CN), Yunnan Normal University (CN), Inner Mongolia University (CN), Shandong Normal University (CN)
National Natural Science Foundation of China
Decent work and economic growth
Openalex Percentile: Top 0%
Scheduling and Optimization Algorithms
37.27
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.