Art der Publikation: Beitrag in Zeitschrift

A Worker Constrained Flexible Job Shop Scheduling Problem with Sequence-Dependent Setup Times

Autor(en):

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

Titel der Zeitschrift:

OR Spectrum

Jahrgang (Veröffentlichung):

41 (2019)

Heftnummer:

1

Seiten:

179-217

Sprache:

Englisch

Schlagworte:

Scheduling, Flexible job shop, Decomposition, Logic inequalities, Vehicle routing

Digital Object Identifier (DOI):

doi:10.1007/s00291-018-0537-z

Zitation:

Download BibTeX

Kurzfassung

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.