Stochastic Flow Shops

Hamilton Emmons () and George Vairaktarakis ()
Additional contact information
Hamilton Emmons: Case Western Reserve University
George Vairaktarakis: Case Western Reserve University

Chapter Chapter 11 in Flow Shop Scheduling, 2013, pp 303-317 from Springer

Abstract: Abstract When job parameters are uncertain or unpredictable, new types of policies become possible. Besides static policies, we now should consider dynamic policies, with or without preemption. Objectives too have more variety. The makespan, for example, is now random; we usually choose to minimize its expectation. We present new conditions under which permutation schedule are optimal for two or three machines. If these do not hold, then to minimize expected makespan on two machines: A simple optimum exists when task times are exponential; for arbitrary distributions, Johnson’s Rule is asymptotically optimal; three simple heuristics have been tested using log normal distributions, and give good results in combination. For more than two machines, we report the very limited results that have been published.

Keywords: Completion Time; Optimal Schedule; Task Time; Flow Shop; List Schedule (search for similar items in EconPapers)
Date: 2013
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:isochp:978-1-4614-5152-5_11

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

DOI: 10.1007/978-1-4614-5152-5_11

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().