Minimizing the Expected Makespan in Stochastic Flow Shops

Michael Pinedo
Additional contact information
Michael Pinedo: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1982, vol. 30, issue 1, 148-162

Abstract: The optimization problem of minimizing the completion time in permutation flow shop scheduling is considered under the assumption that the processing times of a job on different machines are independent and identically distributed random variables. Models with and without intermediate storage are considered. Solutions for special cases are found and based on these results a more general rule of thumb is obtained.

Keywords: 570 stochastic model applications; 703 tandem queues; 762 simulation applications (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.1.148 (application/pdf)

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:inm:oropre:v:30:y:1982:i:1:p:148-162

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().