An optimal online algorithm for scheduling two machines with release times

@article{Noga2001AnOO,
  title={An optimal online algorithm for scheduling two machines with release times},
  author={John Noga and Steven S. Seiden},
  journal={Theor. Comput. Sci.},
  year={2001},
  volume={268},
  pages={133-143}
}
We present a deterministic online algorithm for scheduling two parallel machines when jobs arrive over time and show that it is 2 (5− √ 5)≈ 1:38198-competitive. The best previously known algorithm is (3=2)-competitive. Our upper bound matches a previously known lower bound, and thus our algorithm has the best possible competitive ratio. We also present a lower bound of 1.21207 on the competitive ratio of any randomized online algorithm for any number of machines. This improves a previous result… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-9 OF 9 CITATIONS

A best online algorithm for scheduling on two parallel batch machines

  • Theor. Comput. Sci.
  • 2009
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Online scheduling of two identical machines under a grade of service provision

  • 2017 36th Chinese Control Conference (CCC)
  • 2017
VIEW 2 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Multi-Priority Online Scheduling with Cancellations

  • Operations Research
  • 2017
VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

On-line machine scheduling

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

New algorithms for an ancient scheduling problem

Y. Bartal, A. Fiat, H. KarloQ, R. Vohra
  • J. Comput. System Sci. 51 (3)
  • 1995

A

B. Chen
  • van Vliet, G. Woeginger, New lower and upper bounds for on-line scheduling, Operat. Res. Lett. 16 (4)
  • 1994

Similar Papers

Loading similar papers…