Separating online scheduling algorithms with the relative worst order ratio
Leah Epstein (),
Lene M. Favrholdt () and
Jens S. Kohrt ()
Additional contact information
Leah Epstein: University of Haifa
Lene M. Favrholdt: University of Southern Denmark
Jens S. Kohrt: University of Southern Denmark
Journal of Combinatorial Optimization, 2006, vol. 12, issue 4, No 5, 363-386
Abstract:
Abstract 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.
Keywords: Online algorithms; Relative worst order ratio; Scheduling (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-9005-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:12:y:2006:i:4:d:10.1007_s10878-006-9005-9
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-006-9005-9
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().