考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
The problem of scheduling jobs with non-identical sizes on parallel batching machines is considered; the objective is to minimize the maximum completion time (makespan).
使尽量多的工件在其对应交货时间区间内完工的排序问题是NP困难的。
The scheduling Problem that maximize the number of jobs completed in due date window is NP - hard.
在允许机器空闲的条件下，寻找一个工件排序，使得最大提前完工时间最小。
Under the condition of permission the idle insert, a job sequence was determined, which minimize the maximum earliness.
我们所考虑的目标函数由所有工件的加权完工时间之和与对所有工件的实际加工时间偏离额定加工时间的最大不满意程度这两部分组成。
The objective function being considered was the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs processing times that deviated from their specified ones.
完成的工件按照批次进行送货，所有在公共交货期前完工的工件在最优交货期时间一起交付，对批次送货没有量的约束。
Finished jobs are delivered in batches and all the jobs completed before or at the due date are delivered in a batch at the optimal due date. There is no capacity limitation on a batch delivery.
讨论这样一类单机排序问题：每个工件联系一个交货期窗口；如果工件的完工时间落在该工件的交货期窗口内，则称该工件的完工是满意的；排序的优化准则是完工为满意的工件个数最大。
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.
应用推荐