A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
Publication date
2018-11-15
Document type
Forschungsartikel
Author
Organisational unit
University of Siegen
Publisher
Springer
Series or journal
OR Spectrum
ISSN
Periodical volume
41
Periodical issue
1
First page
179
Last page
217
Peer-reviewed
✅
Part of the university bibliography
Nein
Language
English
Keyword
Scheduling
Flexible job shop
Decomposition
Logic inequalities
Vehicle routing
Abstract
We consider a flexible job shop scheduling problem with sequence-dependent setup times that incorporates heterogeneous machine operator qualifications by taking account of machine- and operator-dependent processing times. We analyze two objective functions, minimizing the makespan and minimizing the total tardiness, and present exact and heuristic decomposition-based solution approaches. These approaches divide the scheduling problem into a vehicle routing problem with precedence constraints and an operator assignment problem, and connect these problems via logic inequalities. We assess the quality of our solution methods in an extensive computational study that is based on randomly generated as well as real-world problem instances.
Version
Published version
Access right on openHSU
Metadata only access