Dual-Resource Constraints in Classical and Flexible Job Shop Problems: A State-of-the-Art Review

The Job shop Scheduling Problem (JSP) is one of the most known problems in the domain of the production task scheduling. The Dual-Resource Constrained Job shop Scheduling Problem (DRCJSP) and the Dual-Resource Constrained Flexible Job shop Scheduling Problem (DRCFJSP) are two extensions of the classical JSP consisting of three sub-problems: (i) Assigning operations to resources of machines, (ii) Assigning operations to resources of workers; (iii) Sequencing the operations on the machines considering workers in order to optimize the performance measure. In this paper, we make a state-of-the-art review of the different works proposed for the DRCJSP and DRCFJSP, where we present a new classification schema according to six criteria such as the used method, the machine flexibility, the worker flexibility, the optimization criteria, the implemented approaches, and the structure of the approach.