机器随机故障时使拖后工件数最少的单机调度问题

SCHEDULING FOR MINIMIZING THE NUMBER OF TARDY JOBS ON SINGLE MACHINE SUBJECT TO STOCHASTIC BREAKDOWNS

本文讨论了机器随机故障时，使拖后工件数最少的单机调度问题．结果表明，确定情况下的Moore－Hodgson算法，在机器随机故障时，能以概率1确定最优工件排序．

n this paper, a scheduling problem for minimizing the number.of tardy jobs on a single machine which is subject to stochastic breakdowns is discussed. The result shows thatMoors--Hodgson algorithm can also determine the optimal sequence of the scheduling problem with probability I when the machine is subject to stochastic breakdowns.