Review for Flexible Job Shop Scheduling

Abstract

Flexible Job shop Scheduling Problem (FJSP) is an NP-hard combinatorial optimization problem, which has significant applications in the real world. Due to the complexity and significance, lots of attention have been attracted to tackle this problem. In this paper, the existing solution methods for the FJSP in the recent literature are classified into exact algorithms, heuristics, and meta-heuristics, which are reviewed comprehensively. Moreover, the real-world applications of the FJSP are also introduced. Finally, the development trends for the manufacturing industry are analyzed, and then the future research opportunities of the FJSP are summarized in detail.