HEINZ, V., et al. Constraint Programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers. Computers & Industrial Engineering. 2022, 172 ISSN 0360-8352. DOI 10.1016/j.cie.2022.108586.
This paper examines scheduling problem denoted as P|(seq), ser|C(max )in Graham's notation; in other words, scheduling of tasks on parallel identical machines (P) with sequence-dependent setups (seq) each performed by one of the available servers (ser). The goal is to minimize the makespan (C-max). We propose a Constraint Programming (CP) model for finding the optimal solution and constructive heuristics suitable for large problem instances. These heuristics are also used to provide a feasible starting solution to the proposed CP model, significantly improving its efficiency. This combined approach constructs solutions for benchmark instances of up to 20 machines and 500 tasks in 10 s, with makespans 3 % to 11.5 % greater than the calculated lower bounds with a 5% average. The extensive experimental comparison also shows that our proposed approaches outperform the existing ones.
eng
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
Elsevier
dc.relation.ispartof
Computers & Industrial Engineering
dc.subject
Scheduling
eng
dc.subject
Parallel machines
eng
dc.subject
Sequence-dependent setups
eng
dc.subject
Servers
eng
dc.subject
Constraint Programming
eng
dc.subject
Heuristic
eng
dc.title
Constraint Programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers