Flow Shop Scheduling

Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, Malgorzata Sterna and Jan Weglarz
Additional contact information
Jacek Blazewicz: Poznan University of Technology
Klaus H. Ecker: Clausthal University of Technology
Erwin Pesch: University of Siegen
Günter Schmidt: Saarland University
Malgorzata Sterna: Poznan University of Technology
Jan Weglarz: Poznan University of Technology

Chapter 8 in Handbook on Scheduling, 2019, pp 271-320 from Springer

Abstract: Abstract Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence.

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:ihichp:978-3-319-99849-7_8

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

DOI: 10.1007/978-3-319-99849-7_8

Access Statistics for this chapter

More chapters in International Handbooks on Information Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().