Comparing online algorithms for bin packing problems

Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt

Research output: Contribution to journalArticlepeer-review

Abstract

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 problem. 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
Pages (from-to)13-21
Number of pages9
JournalJournal of Scheduling
Volume15
Issue number1
DOIs
StatePublished - Feb 2012

Keywords

  • Bin coloring
  • Bin covering
  • Bin packing
  • Class-constrained bin packing
  • Online algorithms
  • Open-end bin packing
  • Relative worst-order ratio

ASJC Scopus subject areas

  • Software
  • Engineering (all)
  • Management Science and Operations Research
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Comparing online algorithms for bin packing problems'. Together they form a unique fingerprint.

Cite this