Yu Zhong ZHANG;Shou Yang WANG;Bo Chen;Shu Xia ZHANG
Journal of Systems Science and Complexity. 2001, 14(4): 373-377.
We address the problem of preemptively schedule on-line jobs on arbitrary m uniformly related machines with the objective of minimizing the schedule length. We provide the first on-line algorithm for this general problem, and show that the algorithm for this general problem,and show that the algorithm has a competitive ratio of 1+\sigma.