Mathematical models for a flexible job shop scheduling problem with machine operator constraints
Publication date
2019-12-25
Document type
Konferenzbeitrag
Author
Müller, David
Organisational unit
Universität Siegen
Scopus ID
Conference
9th IFAC Conference on Manufacturing Modelling, Management and Control (MIM 2019) ; Berlin, Germany ; August 28–30, 2019
Publisher
Elsevier
Series or journal
IFAC-PapersOnLine
ISSN
Periodical volume
52
Periodical issue
13
First page
94
Last page
99
Peer-reviewed
✅
Part of the university bibliography
Nein
Language
English
Keyword
Constraint programming
Flexible job shop
Mixed-integer programming
Scheduling
Workforce constraints
Abstract
We consider a flexible job shop scheduling problem that incorporates machine operators and aims at makespan minimization. In a detailed overview of the related literature, we reveal the fact that the research in this field is mainly concerned with (meta-)heuristic approaches. Only few papers consider exact approaches. In order to promote the use of exact approaches and in order to facilitate the evaluation of the performance of heuristic approaches, we present two mathematical models, a mixed-integer programming model and a constraint programming model, that are analyzed and compared with a state-of-the-art heuristic in computational tests with a standard solver.
Version
Published version
Access right on openHSU
Metadata only access