Separating online scheduling algorithms with the relative worst order ratio
- 47 Downloads
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple pairs of algorithms which have the same competitive ratios; with the relative worst order ratio, the algorithm which is “intuitively better” is also provably better. Moreover, we show one such example for non-preemptive scheduling.
KeywordsOnline algorithms Relative worst order ratio Scheduling
Unable to display preview. Download preview PDF.
- 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–69Google Scholar
- 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–727Google Scholar
- 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–101Google Scholar
- 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–565Google Scholar
- Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Systems Techn J 45:1563–1581Google Scholar
- Kenyon C (1996) Best-fit bin-packing with random order. In Proc. 7th annu. ACM-SIAM symp. on discrete algorithms, pp 359–364Google Scholar
- Kohrt JS (2004) Online algorithms under new assumptions, PhD thesis, Dept Math and Comp Sci, Univ South Den, p. 78.Google Scholar