Better Bounds for Online Scheduling

@inproceedings{Albers1997BetterBF,
  title={Better Bounds for Online Scheduling},
  author={Susanne Albers},
  booktitle={STOC},
  year={1997}
}
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goal is to minimize the makespan. Bartal, Fiat, Karlo and Vohra [3] gave a deterministic online algorithm that is 1.986-competitive. Karger, Phillips and Torng [11] generalized the algorithm and proved an upper bound of 1.945. The best lower bound currently known on the competitive ratio that can be achieved by… CONTINUE READING

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…