摘要
讨论这样一类单机排序问题 :每个工件联系一个交货期窗口 ;如果工件的完工时间落在该工件的交货期窗口内 ,则称该工件的完工是满意的 ;排序的优化准则是完工为满意的工件个数最大。本文证明了上述排序模型是强
In this paper, we consider such a scheduling model: a due date window is associated with each job, a job is call satisfying job if its completion time lies in its corresponding due date window. The objective is to maximize the number of satisfying jobs. We show that the scheduling problem is NP hard in the strong sense.
出处
《系统工程理论方法应用》
2000年第1期1-4,共4页
Systems Engineering Theory·Methodology·Applications
基金
"八六三"计划课题!( 86 3- 30 6 - ZT0 4 - 1)资助
