The flexible job shop scheduling problem: A review

作者：Stéphane Dauzère‐Pérès, Junwen Ding, Liji Shen, Karim Tamssaouet · 发表于：European Journal of Operational Research · 年份：2023 · DOI：10.1016/j.ejor.2023.05.017 · 被引用次数：320 · 研究领域：Scheduling and Optimization Algorithms、Advanced Manufacturing and Logistics Optimization、Optimization and Packing Problems

The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which has wide applications in the real world. The complexity and relevance of the FJSP have led to numerous research works on its modeling and resolution. This paper reviews some of the research of the past 30 years on the problem, by presenting and classifying the different criteria, constraints, configurations and solution approaches that have been considered. Recent emerging topics on complex shop scheduling, multi-criteria optimization and uncertain and dynamic environments are discussed. Finally, future research opportunities are proposed.