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

David Müller (), Dominik Kress () and Jenny Nossack ()
Additional contact information
David Müller: University of Siegen
Dominik Kress: University of Siegen
Jenny Nossack: HHL Leipzig

A chapter in Operations Research Proceedings 2018, 2019, pp 481-488 from Springer

Abstract: 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.

Keywords: Scheduling; Flexible job shop; Decomposition; Priority rules (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-18500-8_60

Ordering information: This item can be ordered from
http://www.springer.com/9783030185008

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

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().