A Review on Intelligent Scheduling and Optimization for Flexible Job Shop

Flexible job shop scheduling problem is a NP-hard combinatorial optimization problem, which has significant applications in the field of workshop scheduling and intelligent manufacturing. Due to its complexity and significance, lots of attention have been paid to tackle this problem. This paper reviews some of the researches on this problem, by presenting and classifying the different criteria, constraints, and solution approaches. The existing solution methods for the flexible job shop scheduling problem in this literature are classified into exact algorithms, heuristics, and meta-heuristics, which are thoroughly reviewed. Particularly, the paper highlights the flexible job shop scheduling problem in the context of dynamic events and preventive maintenance. These dynamic events, such as machine breakdowns and unexpected changes in job requirements, present additional challenges to the scheduling problem. Furthermore, this paper analyzes the development trends in the manufacturing industry and summarizes detailed future research opportunities for the flexible job shop scheduling problem.