Stochastically minimizing the makespan in flow shops

R. D. Foley and S. Suresh

Naval Research Logistics Quarterly, 1984, vol. 31, issue 4, 551-557

Abstract: In this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n ‐ 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last.

Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800310405

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:wly:navlog:v:31:y:1984:i:4:p:551-557

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().