Type of Publication: Article in Collected Edition

Exact and Heuristic Solution Approaches for a Flexible Job Shop Scheduling Problem Incorporating Machine Operator Restrictions

Author(s):

Müller, D.; Kress, D.; Nossack, J.

Editor:

Fortz, B.; Labbé, M.

Title of Anthology:

Operations Research Proceedings 2018

pages:

481-488

Publisher:

Springer

Location(s):

Cham

Publication Date:

2019

ISBN:

978-3-030-18500-8

Language:

Englisch

Keywords:

Scheduling, Flexible job shop, Decomposition, Priority rules 

Digital Object Identifier (DOI):

doi:10.1007/978-3-030-18500-8_60

Citation:

Download BibTeX

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.