This paper studies semi online parallel machine scheduling problems.
本文主要考虑平行机半在线排序问题。
This paper considers the parallel machine scheduling problem with delivery times.
本文考虑了带传递时间的平行机排序问题。
In literatures of classical parallel machine scheduling, people often study the precedence constraint among jobs.
在经典的平行机排序文献中，人们往往研究工件间的序约束。
We discuss the nonpreemptive parallel machine scheduling problem with nonsimultaneous available time, the objective function is to minimize the makespan.
讨论任务的加工是不可中断，机器速度相同且机器具有不同开始加工时间的排序问题，目标函数是极小化最大完工时间。
We discuss the nonpreemptive parallel machine scheduling problem with nonsimultaneous available time, the objective function is to minimize the makespan.
讨论任务的加工是不可中断，机器速度相同且机器具有不同开始加工时间的排序问题，目标函数是极小化最大完工时间。
应用推荐