多项式可解的单机加权E/T调度问题

SINGLE MACHINE WEIGHTED E/T SCHEDULING SOLVED IN POLYNOMIAL BOUND TIME

研究了目标函数为完成时间与交货期差平方的加权和的单机调度问题，在工件的权值与加工时间成比例时，给出了问题的最优解．然后，在假设描述机器随机故障次数的计数过程为广义泊松过程时，将上述结果推广到机器有随机故障的情形．

The problem of scheduling n jobs on a single machine to minimize the weighted sum of squared deviations of jobs' completion times from their due dates is considered . The optimal solution is abstained when the weights are proportional to the processing times. Moreover, The case of the problem where the machine is subject to stochastic breakdowns when the counting process N(t) describing the number of breakdowns is a generalized Poisson process is discussed also.