A lower bound for randomized on-line multiprocessor scheduling

Information Processing Letters

Volumn 63, Issue 1, 1997, Pages 51-55

  Sgall, Jiří ^a  

^a INSTITUTE OF MATHEMATICS   (Czech Republic)

Author keywords

Combinatorial problems; On line algorithms; Randomization; Scheduling; Worst case bounds

Indexed keywords

EID: 0002907953     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00093-8     Document Type: Article

References (10)

1. Y. Bartal, A. Fiat, H. Karloff and R. Vohra, New algorithms for an ancient scheduling problem, J. Comput. System Sci. 51 (3) (1995) 359-366.
2. Y. Bartal, H. Karloff and Y. Rabani, A new lower bound for m-machine scheduling. Inform. Process. Lett. 50 (1994) 113-116.
3. B. Chen, A. van Vliet and G.J. Woeginger, A lower bound for randomized on-line scheduling algorithms, Inform. Process. Lett. 51 (1994) 219-222.
4. B. Chen, A. van Vliet and G.J. Woeginger, An optimal algorithm for preemptive on-line scheduling, Oper. Res. Lett. 18 (1995) 127-131.
5. U. Faigle, W. Kern and G. Turan, On the performance of on-line algorithms for partition problems, Acta Cybernet. 9 (1989) 107-119.
6. G. Galambos and G.J. Woeginger, An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling, SIAM J. Comput 22 (2) (1993) 349-355.
7. R.L. Graham, Bounds for certain multiprocessor anomalies, Bell System Tech. J. 45 (1966) 1563-1581.
8. D.R. Karger, S.J. Phillips and E. Torng, A better algorithm for an ancient scheduling problem, in: Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (ACM-SIAM, 1994) 132-140.
9. S. Seiden, A randomized algorithm for that ancient scheduling problem, Manuscript, 1996.
10. J. Sgall, On-line scheduling on parallel machines, Ph.D. Thesis, Tech. Rept. CMU-CS-94-144, Carnegie-Mellon University, Pittsburgh, PA, USA, 1994.