具有不同初始开工时间的P∥C_(max)问题

The Multifit Algorithm for P∥C max Problem with Different Initial Starting Time

在每台处理机的初始开工时间不同的情况下讨论平行机调度问题的Ｍｕｌｔｉｆｉｔ算法．分析了Ｍｕｌｔｉｆｉｔ算法的可行性并证明其最差情况性能指标界满足Ｒｍ（ＭＦ［ｋ］）≤１．

The Multifit Algorithm for P∥C max  problem is considered in the case that the initial starting time of cach processor is different. The feasibility of the multifit algorithm is analyzed and the worst case performance bound satisfying R m(MF)≤1 29+1/2 k is proved.