摘要
分别研究了交货期及交货期窗口下的单机调度问题，目标是寻找一个最优调度极小化提前／拖期任务数．假设如果任务在交货期或交货期窗口内完工，则不受处罚；否则，就要受到一个固定的提前／拖期惩罚．提出了在交货期及交货期窗口下的寻找最优调度的多项式算法，并以两个实例说明了算法．
It was done on a single machine to deal with due date and due window problems. The objective was to find a shcedule that minimizes the number of early and tardy jobs. It was assumed that each job was not penalized if its completion timed within due window. Otherwise,it would be penalized by the fixed identical weight. Two polynomial algorithms were presented to find the optimal schedule for due date and due window and two examples were shown to illustrate the algorithms.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
1998年第6期599-601,共3页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金
