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

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 restricti...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of production research Ročník 60; číslo 7; s. 2212 - 2229
Hlavní autori:	Yunusoglu, Pinar, Topaloglu Yildiz, Seyda
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis 03.04.2022 Taylor & Francis LLC
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!