A preemptive uniform machine scheduling problem with arrival time and minimum makespan is studied in this paper.
研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。
The minimum time that needs to execute a batch of tasks is called makespan.
若干台处理机完成一批任务所需要的最少时间称为完工时间。
The minimum time that needs to execute a batch of tasks is called makespan.
若干台处理机完成一批任务所需要的最少时间称为完工时间。
应用推荐