排序问题P_m,a_i|on-line|C_(max)的LPT算法

LPT Algorithm for Scheduling Problem P_m,a_i|on-line|C_(max)

讨论了任务实时到达的平行机在线排序问题。Chen和Vestjens证明了LPT算法的界为 3/2。将这一结论推广到了处理机具有准备时间的情况。

In this paper we discuss the on line parallel processors scheduling problem where tasks arrive over time. Chen and Vestjens proved that the bound of LPT is 3/2. We generalize the result to the case where the processors have ready time.