Comparing Online Algorithms for Bin Packing Problems

Leah Epstein, Lene Monrad Favrholdt, Jens Svalgaard Kohrt

Research output: Contribution to journalJournal articleResearchpeer-review


The relative worst-order ratio is a measure of the quality of online
algorithms. In contrast to the competitive ratio, this measure
compares two online algorithms directly instead of
using an intermediate comparison with an optimal offline algorithm.

In this paper, we apply the relative worst-order ratio to online
algorithms for several common variants of the bin packing
We mainly consider pairs of algorithms that are not distinguished by
the competitive ratio and show that the relative worst-order ratio
prefers the intuitively better algorithm of each pair.
Original languageEnglish
JournalJournal of Scheduling
Issue number1
Pages (from-to)13-21
Number of pages9
Publication statusPublished - 2012

Cite this