考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
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.
应用推荐