Optimizing Dynamic Flexible Job Shop Scheduling Using an Evolutionary Multitask Optimization Framework and Genetic Programming
IEEE Transactions on Evolutionary Computation · 2025-10 · 29 (5) · 1502-1516
DOI: 10.1109/tevc.2025.3543770 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2025-10. Verfasst von Xiaolong Chen und 5 weiteren Autor:innen. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 52 Literaturangaben. Gefördert von: National Science Foundation of China, Key Projects of Yunnan Province Basic Research Program, Yunnan Key Laboratory of Modern Analytical Mathematics and Applications.
Abstract (Originalsprache)
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.
Förderung
- National Science Foundation of China
- Key Projects of Yunnan Province Basic Research Program
- Yunnan Key Laboratory of Modern Analytical Mathematics and Applications
Zitieren
APA
Chen, X., Li, J., Wang, Z., Chen, Q., Gao, K., & Pan, Q. (2025). Optimizing Dynamic Flexible Job Shop Scheduling Using an Evolutionary Multitask Optimization Framework and Genetic Programming. IEEE Transactions on Evolutionary Computation, 29(5), 1502-1516. https://doi.org/10.1109/tevc.2025.3543770
Vancouver
Chen X, Li J, Wang Z, Chen Q, Gao K, Pan Q. Optimizing Dynamic Flexible Job Shop Scheduling Using an Evolutionary Multitask Optimization Framework and Genetic Programming. IEEE Transactions on Evolutionary Computation. 2025;29(5):1502-1516. doi:10.1109/tevc.2025.3543770
BibTeX
@article{Chen2025,
author = {Chen, Xiaolong and Li, Junqing and Wang, Zunxun and Chen, Qingda and Gao, Kaizhou and Pan, Quanke},
title = {Optimizing Dynamic Flexible Job Shop Scheduling Using an Evolutionary Multitask Optimization Framework and Genetic Programming},
journal = {IEEE Transactions on Evolutionary Computation},
year = {2025},
volume = {29},
number = {5},
pages = {1502--1516},
doi = {10.1109/tevc.2025.3543770}
}
EUVIMED