ABSTRACT
Scheduling, as a form of decision making, is gradually becoming a crucial factor in various domains, such as manufacturing, transportation, and commercial business.The Job Shop Scheduling Problem (JSP) is one of the most popular scheduling models existing in practice [1], which has been proven to be NP-hard [2]. In a JSP, several jobs must be completed on a group of machines under some predefined constraints. Moreover, each operation of a job can be processed on only one machine. The flexible job shop scheduling problem (FJSP) is an extension of classical JSP, which is closer to the real-world manufacturing situation. The main difference between JSP and FJSP is that the operation can be processed on a set of predefined machines in the latter.
