Separating online scheduling algorithms with the relative worst order ratio

Journal of Combinatorial Optimization

Volumn 12, Issue 4, 2006, Pages 362-385

  Epstein, Leah ^a   Favrholdt, Lene M ^b   Kohrt, Jens S ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Online algorithms; Relative worst order ratio; Scheduling

Indexed keywords

COMPETITIVE RATIO; OFFLINE ALGORITHMS; ONLINE ALGORITHMS; RELATIVE WORST ORDER RATIO;

ALGORITHMS; OPERATIONS RESEARCH; PROBLEM SOLVING; PRODUCTION ENGINEERING; SCHEDULING;

ONLINE SYSTEMS;

EID: 33749641366     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9005-9     Document Type: Article

References (22)

1. Albers S (1999) Better bounds for online scheduling. SIAM J Comput 29(2):459-473
2. Bartal Y, Fiat A, Karloff H, Vohra R (1995) New algorithms for an ancient scheduling problem. J Comput Syst Sci 51(3):359-366
3. Ben-David S, Borodin A (1994) A new measure for the study of on-line algorithms. Algorithmica 11(1):73-91
4. Boyar J, Favrholdt LM (2003) The relative worst order ratio for on-line algorithms. In Proc. 5th Italian conf. on algorithms and complexity, vol. 2653 of Lect Notes Comp Sci Springer-Verlag, pp 58-69
5. Boyar J, Favrholdt LM, Larsen KS (2005) The relative worst order ratio applied to paging. In Proc. 16th Annu. ACM-SIAM symp. discrete algorithms, pp 718-727
6. Boyar J, Medvedev P (2004) The relative worst order ratio applied to seat reservation. In Proc. of the 9th scand. workshop on algorithm theory, vol. 3111 in Lect Notes Comp Sci pp 90-101
7. Chen B, van Vliet A, Woeginger GJ (1995) An optimal algorithm for preemptive on-line scheduling. Oper Res Lett 18(3):127-131
8. Cho Y, Sahni S (1980) Bounds for list schedules on uniform processors. SIAM J Comput 9(1):91-103
9. Epstein L, Noga J, Seiden SS, Sgall J, Woeginger GJ (2001) Randomized online scheduling on two uniform machines. J Sched 4(2):71-92
10. Epstein L, Sgall J (2000) A lower bound for on-line scheduling on uniformly related machines. Oper Res Lett 26(1):17-22
11. Faigle U, Kern W, Turän G (1989) On the performance of on-line algorithms for partition problems. Acta Cybernet 9(2):107-119
12. Fleischer R, Wahl M (2000) On-line scheduling revisited. J Sched 3(6):343-353
13. Galambos G, Woeginger GJ (1993) An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling. SIAM J Comput 22(2):349-355
14. Gonzalez T, Sahni S (1978) Preemptive scheduling of uniform processor systems. J ACM 25(1):92-101
15. Gormley T, Reingold N, Torng E, Westbrook J (2000) Generating adversaries for request-answer games. In Proc. 11th annu. ACM-SIAM symp. on discrete algorithms, pp 564-565
16. Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Systems Techn J 45:1563-1581
17. Karger DR, Philips SJ, Torng E (1996) A better algorithm for an ancient scheduling problem. J Algorithms 20(2):400-430
18. Kenyon C (1996) Best-fit bin-packing with random order. In Proc. 7th annu. ACM-SIAM symp. on discrete algorithms, pp 359-364
19. Kohrt JS (2004) Online algorithms under new assumptions, PhD thesis, Dept Math and Comp Sci, Univ South Den, p. 78.
20. McNaughton R (1959) Scheduling with deadlines and loss functions. Manag Sci 6(1):1-12
21. Seiden SS (2001) Preemptive multiprocessor scheduling with rejection. Theoret Comp Sci 262(1-2):437-458
22. Wen J, Du D (1998) Preemptive on-line scheduling for two uniform processors. Oper Res Lett 23:113-116