论文部分内容阅读
We address the problem of preemptively schedule on-line jobs on arbitrary muniformly 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 being the speeds of the m machines.