No-idle flow shop(NIFS) problem with makespan criterion is studied.
研究了以最大完工时间为目标的零空闲流水线调度问题。
The minimum time that needs to execute a batch of tasks is called 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).
考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
We discuss the nonpreemptive parallel machine scheduling problem with nonsimultaneous available time, the objective function is to minimize the makespan.
讨论任务的加工是不可中断，机器速度相同且机器具有不同开始加工时间的排序问题，目标函数是极小化最大完工时间。
This paper focuses on scheduling unit length multiprocessor tasks with de-creasing chain precedence constrains on three identical processors so as to minimize makespan.
研究三个并行处理器环境中，具有递减链约束的多处理器任务的调度问题，调度目标是最小化总处理时间，假设单项任务需单位处理时间。
This paper focuses on scheduling unit length multiprocessor tasks with de-creasing chain precedence constrains on three identical processors so as to minimize makespan.
研究三个并行处理器环境中，具有递减链约束的多处理器任务的调度问题，调度目标是最小化总处理时间，假设单项任务需单位处理时间。
应用推荐