Mathematical Models for a Flexible Job Shop Scheduling Problem with Machine Operator Constraints

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. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.