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.
|Number of pages||5|
|Journal||Naval Research Logistics Quarterly|
|State||Published - 1 Feb 1985|
|Event||Proc of the Workshop on Qual Control, New Dev and Pract for Sampling Insp - Washington, DC, USA|
Duration: 7 Mar 1983 → 8 Mar 1983
ASJC Scopus subject areas
- Engineering (all)