A preemptive uniform machine scheduling problem with arrival time and minimum makespan is studied in this paper.
研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。
The problem of uniform parallel machine scheduling was considered so as to minimizing total completion times.
研究了目标函数是最小最大完成时间的同类机调度问题，其中作业到达时间可能不同。
应用推荐