Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times

• Published in: International journal of production research Vol. 60; no. 7; pp. 2212 - 2229
• Main Authors: Yunusoglu, Pinar, Topaloglu Yildiz, Seyda
• Format: Journal Article
• Language: English
• Published: London Taylor & Francis 03.04.2022; Taylor & Francis LLC
• Subjects: branching strategies; Completion time; constraint programming; Constraints; Exact solutions; Lower bounds; multiple resources; Polynomials; Scheduling; Setup times; Unrelated parallel machines
• ISSN: 0020-7543; 1366-588X
• DOI: 10.1080/00207543.2021.1885068

This paper studies the multi-resource-constrained unrelated parallel machine scheduling problem under various operational constraints with the objective of minimising maximum completion time among the scheduled jobs. Sequence-dependent setup times, precedence relations, machine eligibility restrictions and release dates are incorporated into the problem as operational constraints to reflect real-world manufacturing environments. The considered problem is in NP-hard class of problems, which cannot be solved in deterministic polynomial time. Our aim in this study is to develop an exact solution approach based on constraint programming (CP), which shows good performance in solving scheduling problems. In this regard, we propose a CP model and enrich this model by adding lower bound restrictions and redundant constraints. Moreover, to achieve a reduction in computation time, we propose two branching strategies for the proposed CP model. The performance of the CP model is tested using randomly generated and benchmark instances from the literature. The computational results indicate that the proposed CP model outperforms the best solutions with an average gap of 15.52%.