Optimal and Online Preemptive Scheduling on Uniformly Related Machines

We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4-competitive deterministic and an e ≈ 2.71-competitive randomized online algorithm. In addition, it matches the performance of the previously known algorithms for the offline case, with a considerably simpler proof. Finally, we study the performance of greedy heuristics for the same problem.

• Type: Conference
• Year: 2004
• Where: STACS
• Authors: Tomás Ebenlendr, Jiri Sgall
• Keywords: Preemptive Scheduling, STACS 2004, Standard Doubling Technique, Theoretical Computer Science, Uniformly Related Machines