目标函数是最大延误的数学期望的单机随机调度问题

Stochastic Single Machine Scheduling to Minimize the Expectation of Maximum Tardiness

在任务的加工时间和工期是相互独立的随机变量的情况下研究单机随机排序问题,目标函数为最大延误的数学期望。通过理论分析,给出了该问题的不可中断静态优先策略,并通过实例验证。

The stochastic scheduling on a single machine is discussed to minimize the expectation of maximum tardiness with random processing times and due dates.The non-preemptive static list policy of the priority can be given by theoretical analysis and the algorithm is verified by the example.