关于机器随机故障完工时间方差最小化单机调度问题

摘要

This paper addresses a stochastic scheduling problem in which n jobs are to be processed on a single machine. The machine is subject to stochastic breakdowns, which is characterized by a generalized Poisson process. The objective is to find the job schedules to minimize the expected variance of completion times. The deterministic equivalent of the stochastic scheduling problem is developed. Moreover, optimal sequences are derived for the special case with identical processing times.%讨论了机器随机故障时,工件完工时间方差的期望最小化单机调度问题,其中描述机器故障的计数过程为广义泊松过程.推导出了目标函数等价的确定形式,而后进一步给出了工件加工时间相同时问题的最优解.