Abstract
This paper deals with a two-machine stochastic flow shop with an infinite storage between the machines. We present a new sufficient condition on the job processing time distributions that implies that the makespan becomes stochastically smaller when two jobs in a given job sequence are interchanged. This condition is weaker than that given by Ku and Niu (P.-S. Ku, S.-C. Niu, On Johnson's two machine flow shop with random processing times, Opns. Res. 34 (1986) 130–136), and is not restricted to adjacent jobs. It is claimed that all optimal scheduling rules for minimizing the makespan, that have been identified so far in the literature, can be derived from the new condition. Examples and generalizations of known results are presented.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
