Metaheuristics in Machine Scheduling

Günther Zäpfel (), Roland Braune () and Michael Bögl ()
Additional contact information
Günther Zäpfel: Universität Linz
Roland Braune: Universität Linz
Michael Bögl: Universität Linz

Chapter Chapter 9 in Metaheuristic Search Concepts, 2010, pp 159-235 from Springer

Abstract: Abstract Shop-based machine scheduling involves finding a sequence in which a set of work orders or jobs is processed on each of multiple machines. In this context, the order of production steps, also referred to as the process routing of each job has to be considered. In the job shop case, process routings are not required to be identical like in flow lines, hence they may be predefined individually for each job. In scientific literature, a production step is commonly referred to as an operation and the process routings are specified by so called precedence constraints.

Keywords: Greedy Randomize Adaptive Search Proce; Tabu List; Short Processing Time; Constructive Heuristic; Priority Index (search for similar items in EconPapers)
Date: 2010
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:sprchp:978-3-642-11343-7_9

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

DOI: 10.1007/978-3-642-11343-7_9

Access Statistics for this chapter

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