通过分析飞机运行的时区集合特点，将飞机调度问题转化为固定工件排序问题。
In order to solve airline aircraft dispatching problem which is NPC problem, time intervals which aircraft processes are analyzed.
基于交货期的模具车间作业调度问题是解决不同类型工件的加工排序，使其误工最少。
The mould manufacture scheduling based on due date is a problem of how to schedule operation processing sequence to minimize tardiness.
结果表明，所提出算法至少可以求解25个工件规模的越库配送排序问题。
The computational experiments show that the proposed DP algorithm can handle problems up to at least 25 jobs.
使尽量多的工件在其对应交货时间区间内完工的排序问题是NP困难的。
The scheduling Problem that maximize the number of jobs completed in due date window is NP - hard.
研究了工件可拒绝排序问题。
在加工时间可压缩的排序问题中，工件的加工时间参数是不固定的，因此我们可以压缩工件原始的加工时间，产生压缩费用。
In the controllable processing time problems, time parameters of jobs may not be fixed, so we can compress the original processing time, and reduce the corresponding pressure cost.
在单机重新排序问题中，一个原始工件集已经排好顺序，使得给定的目标函数最小。
In the rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives and creates a disruption.
讨论这样一类单机排序问题：每个工件联系一个交货期窗口；如果工件的完工时间落在该工件的交货期窗口内，则称该工件的完工是满意的；排序的优化准则是完工为满意的工件个数最大。
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.
讨论了工件加工时间随开工时间线性增加的成组排序问题，考虑的目标函数是总完工时间，在成组技术的限制下，总完工时间问题是多项式时间可解的。
In these two problems, the job processing time is a linear decreasing function of its starting time, the objective is to minimize the total completion time.
讨论了工件加工时间随开工时间线性增加的成组排序问题，考虑的目标函数是总完工时间，在成组技术的限制下，总完工时间问题是多项式时间可解的。
In these two problems, the job processing time is a linear decreasing function of its starting time, the objective is to minimize the total completion time.
应用推荐