Two-Stage Production Scheduling with Separated Set-Up Times and Stochastic Breakdowns
研究了双机流水车间中设置时间与加工时间分离且机器随机故障下的调度问题，以最小化完工时间，建立了概率为1的占优关系，并证明了确定性算法在随机故障下仍能随机最小化完工时间。
The problem of scheduling a two-machine flowshop, where set-up times are considered as separate from processing times and machines suffer random breakdowns, is addressed with respect to the makespan objective. A dominance relation for minimizing makespan with probability 1 is established. Furthermore, it is shown that Yoshida and Hitomi's algorithm for the deterministic problem stochastically minimizes makespan when random breakdowns are present.