A fully parallel multi-objective genetic algorithm for optimization of flexible shop floor production performance and schedule stability under dynamic environments

Jia Luo (), Didier El Baz (), Rui Xue (), Jinglu Hu () and Lei Shi ()
Additional contact information
Jia Luo: Beijing University of Technology
Didier El Baz: Université de Toulouse, CNRS
Rui Xue: Beijing University of Technology
Jinglu Hu: Waseda University
Lei Shi: Communication University of China

Annals of Operations Research, 2025, vol. 351, issue 1, No 18, 489-524

Abstract: Abstract As the work environment changes dynamically in real-world manufacturing systems, the dynamic flexible job shop scheduling is an essential problem in operations research. Some works have taken rescheduling approaches to solve it as the multi-objective optimization problem. However, previous studies focus more on solution quality improvements while ignoring computation time. To get a quick response in the dynamic scenario, this paper develops a fully parallel Non-dominated Sorting Genetic Algorithm-II (NSGA-II) on GPUs and uses it to solve the multi-objective dynamic flexible job shop scheduling problem. The mathematical model is NP-hard which considers new arrival jobs and seeks a trade-off between shop efficiency and schedule stability. The proposed algorithm can be executed entirely on GPUs with minimal data exchange while parallel strategies are used to accelerate ranking and crowding mechanisms. Finally, numerical experiments are conducted. As our approach keeps the original structure of the conventional NSGA-II without sacrificing the solutions’ quality, it gains better performance than other GPU-based parallel methods from four metrics. Moreover, a case study of a large-size instance is simulated at the end and displays the conflicting relationship between the two objectives.

Keywords: Evolutionary computations; Parallel NSGA-II; GPU computing; Multi-objective optimization; Flexible job shop scheduling; Dynamic scheduling (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-025-06482-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:351:y:2025:i:1:d:10.1007_s10479-025-06482-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-025-06482-2

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().