The scheduling Problem that maximize the number of jobs completed in due date window is NP - hard.

使尽量多的工件在其对应交货时间区间内完工的排序问题是NP困难的。

youdao

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.

讨论这样一类单机排序问题：每个工件联系一个交货期窗口；如果工件的完工时间落在该工件的交货期窗口内，则称该工件的完工是满意的；排序的优化准则是完工为满意的工件个数最大。

youdao

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.

讨论这样一类单机排序问题：每个工件联系一个交货期窗口；如果工件的完工时间落在该工件的交货期窗口内，则称该工件的完工是满意的；排序的优化准则是完工为满意的工件个数最大。

youdao