Three‐machine flowshop stochastic scheduling to minimize distribution of schedule length

E. Frostig and I. Adiri

Naval Research Logistics Quarterly, 1985, vol. 32, issue 1, 179-183

Abstract: This article studies a special case of stochastic three‐machine, permutation flowshop scheduling. It is proved that a sequence where processing times on the first and third machines are in a monotone nondecreasing and nonincreasing order of the likelihood ratio, respectively, and on the second machine are equally distributed, minimizes distribution of schedule length.

Date: 1985
References: Add references at CitEc
Citations:

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

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:32:y:1985:i:1:p:179-183

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