带到达时间分批排序问题的数学模型-毕业论文参考网 关键词：分批排序；最大完工时间；到达时间；数学规划． [gap=492]Keywords：batch scheduling；makespan；release time；mathematical programming
基于48个网页-相关网页
研究了以最大完工时间为目标的零空闲流水线调度问题。
No-idle flow shop(NIFS) problem with makespan criterion is studied.
考虑并行批加工机上不同尺寸工件的调度问题；目标是极小化最大完工时间。
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).
因此问题就需要决定是否中断，以及何时中断，使得最大完工时间、完工时间总和、加权完工时间总和等尽可能小。
Thus the problem is to make a decision on whether and when to start the breakdown so as to minimize the maximum completion time, the total completion time or the weighted total completion time.
应用推荐