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.
研究了目标函数是最小最大完成时间的同类机调度问题，其中作业到达时间可能不同。
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.
讨论任务的加工是不可中断，机器速度相同且机器具有不同开始加工时间的排序问题，目标函数是极小化最大完工时间。
This concept is the integration of identical parallel machine scheduling with flow shop scheduling. The solution to IFSP is a non- polynomial computation of time problem.
采用网络理论构造了平行流水作业的非连接图模型，提出了采用蚁群算法求解平行流水作业计划问题，以及求解过程中可行路径表的建立方法。
Aiming at the total weighted tardiness scheduling problem of unrelated parallel machine, a kind of hybrid ant colony optimization algorithm was proposed.
针对一类变速机总加权拖期调度问题，提出一种混合蚁群优化算法。
Aiming at the total weighted tardiness scheduling problem of unrelated parallel machine, a kind of hybrid ant colony optimization algorithm was proposed.
针对一类变速机总加权拖期调度问题，提出一种混合蚁群优化算法。
应用推荐