Paper Info
Title
Constraint Programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers
Abstract
This paper examines scheduling problem denoted as P|seq,ser|Cmax 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 (Cmax). 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.
Year
DOI
Venue
2022
10.1016/j.cie.2022.108586
Computers & Industrial Engineering
Keywords
DocType
Volume
68M20,90-08,90B35,90C59,90C99
Journal
172
Issue
ISSN
Citations 
Part A
0360-8352
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Vilém Heinz100.34
Antonin Novak221.71
Marek Vlk300.34
Zdenk Hanzálek4576.67