in this paper, we first consider the rescheduling problem to minimize the maximum lateness under a limit on the disruption constraints when d_j, p_j are compatible;
该论文首先研究了当工件加工时间和工期相容时,在错位量限制的条件下最小化最大延迟问题;
taking the maximum lateness as objective function, this paper develops a polynomial time algorithms for the processing sequence of then jobs given or not given.
文中以工件的最大迟后为目标函数,对上述分批问题用动态规划技术给出了一多项式时间算法。
optimal algorithms are presented respectively for single machine scheduling problems of minimizing the makespan, weighted sum of completion times, maximum lateness and maximum cost.
对单机调度问题中目标函数为极小化最大完工时间加权完工时间和,最大延误以及最大费用等问题分别给出了最优算法。