·2,447,543篇论文数据，部分数据来源于NoteExpress
This paper studies semi online parallel machine scheduling problems.
本文主要考虑平行机半在线排序问题。
This paper considers the parallel machine scheduling problem with delivery times.
本文考虑了带传递时间的平行机排序问题。
The problem of uniform parallel machine scheduling was considered so as to minimizing total completion times.
研究了目标函数是最小最大完成时间的同类机调度问题，其中作业到达时间可能不同。
应用推荐