Abstract
AbstractThis 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have