Exact and heuristic solution approaches for a flexible job shop scheduling problem incorporating machine operator restrictions
Publication date
2019-08-30
Document type
Konferenzbeitrag
Author
Organisational unit
Universität Siegen
Conference
Annual International Conference of the German Operations Research Society e.V. (OR 2018) ; Brussels, Belgium ; September 12–14, 2018
Publisher
Springer
Series or journal
Operations Research Proceedings
Book title
Operations Research Proceedings 2018
First page
481
Last page
488
Peer-reviewed
✅
Part of the university bibliography
Nein
Language
English
Abstract
This paper addresses a flexible job shop scheduling problem with sequence-dependent setup times that incorporates heterogeneous machine operator qualifications. The objective is to minimize the makespan. We present a mixed-integer program and sketch exact and heuristic solution approaches that are based on a decomposition of the problem into a vehicle routing problem and a machine operator assignment problem. The solution methods are analyzed in computational tests. For details, we refer to our full paper.
Version
Published version
Access right on openHSU
Metadata only access