An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems

Abstract

In this paper, we study the group shop and the mixed shop scheduling problems with single and identical parallel machines at each workstation with the makespan criterion. We adapted a constraint programming formulation previously presented for the classical resource-constrained project scheduling problem. The effectiveness of our approach is evident in the fact that it achieved optimality in 107 out of 130 classical group shop scheduling problem instances and in 320 classical mixed shop scheduling problem instances. In the last set, we obtained 13 new optimal solutions. © 2024 International Federation of Operational Research Societies.