Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help

@inproceedings{Chrobak2004OnlineSO,
  title={Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help},
  author={Marek Chrobak and Wojciech Jawor and Jir{\'i} Sgall and Tom{\'a}s Tich{\'y}},
  booktitle={ICALP},
  year={2004}
}
This is a very nice paper which gives improved bounds for several variants of single machine online scheduling, where all jobs have the same (not unit) length. I find the paper suitable for the SIAM Journal on Computing. The paper introduces many new ideas and makes use of them to improve the previous bounds. The paper is written carefully, and can be accepted for publication. Some minor remarks are listed below. 

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Online

  • M. H. Goldwasser, M. Pedigo
  • non-preemptive scheduling of equal-length jobs on…
  • 2006
1 Excerpt

Online scheduling of equal-length jobs: Randomization and restarts help

  • M. Chrobak, W. Jawor, J. Sgall, T. Tichý
  • Proc. 31st International Colloquium on Automata…
  • 2004
1 Excerpt

Randomized on-line scheduling for two related machines

  • L. Epstein, J. Noga, S. S. Seiden, J. Sgall, G. J. Woeginger
  • J. Sched., 4
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…