Review on flexible job shop scheduling

• DOI: 10.1049/iet-cim.2018.0009
• Publication Date: 2019-06-22T02:22:45Z
• Authors: Jin Xie; Liang Gao; Kunkun Peng; Xinyu Li; Haoran Li
• Keywords: Heuristics; Job shop

Flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimisation problem, which has significant applications in the real world. Due to its complexity and significance, lots of attentions have been paid tackle this problem. In study, existing solution methods for FJSP recent literature are classified into exact algorithms, heuristics meta-heuristics, reviewed comprehensively. Moreover, real-world also introduced. Finally, development trends manufacturing industry analysed, future research opportunities summarised detail.