Optimal and online preemptive scheduling on uniformly related machines

@article{Ebenlendr2009OptimalAO,
  title={Optimal and online preemptive scheduling on uniformly related machines},
  author={Tom{\'a}s Ebenlendr and Jir{\'i} Sgall},
  journal={J. Scheduling},
  year={2009},
  volume={12},
  pages={517-527}
}
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… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…