The problem of scheduling jobs with chain precedence constraints on identical parallel machines is discussed in this article.
所描述的问题为在平行机台上调度具有单一模具约束的成组工作，以实现最小化总拖期量为目标。
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).
考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
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).
考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
应用推荐