Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds

Verena Gondek ()
Additional contact information
Verena Gondek: University of Duisburg-Essen

A chapter in Operations Research Proceedings 2010, 2011, pp 485-490 from Springer

Abstract: Abstract This paper is concerned with hybrid flow shop scheduling taking account of different additional constraints, especially transportation requests. Our objective is total weighted completion time minimization. We develop a fast (two phase) heuristic solution technique, which is based on simple dispatching rules. To evaluate our approach empirically, we introduce and analyze lower bounds based on the LP relaxation of time-indexed mixed-integer formulations.

Keywords: Lower Bound; Schedule Problem; Completion Time; Operation Research; Research Proceeding (search for similar items in EconPapers)
Date: 2011
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-642-20009-0_77

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

DOI: 10.1007/978-3-642-20009-0_77

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 ().