The Classical Job-Shop Scheduling Problem (JSP)

541 Words2 Pages

The classical job-shop scheduling problem (JSP) is a combinatorial optimization problem, which is among the most complicated problems in the scheduling area. The JSP has been proven to be NP-hard (Zhang et al., 2008). Flexible job-shop scheduling problem (FJSP) is a generalization of the classical JSP. It takes shape when alternative production routing is allowed in the classical job-shop (Al-Hinai, 2011). FJSP is NP-hard due to; (a) assignment decisions of operations to a subset of machines and (b) Sequencing decisions of operations on each machine (Tay and Wibowo, 2004).
Job shop scheduling, generally can be categorized into two main categories, static or deterministic (offline) scheduling and dynamic (online) scheduling. Previous approaches to scheduling in the presence of disruptions can be broadly classified into two groups Liu et al. (2007a). One group offers, a completely reactive job dispatching scheduling, and the second group proposes control strategies to achieve system recovery from disruptions with the consideration of an initial schedule. The main difference between th...

More about The Classical Job-Shop Scheduling Problem (JSP)

Open Document