The problem of uniform parallel machine scheduling was considered so as to minimizing total completion times.

研究了目标函数是最小最大完成时间的同类机调度问题，其中作业到达时间可能不同。

youdao

The problem of uniform parallel machine scheduling was considered so as to minimizing total completion times.

研究了目标函数是最小最大完成时间的同类机调度问题，其中作业到达时间可能不同。

youdao