Comparing online algorithms for bin packing problems

Authors:
Leah Epstein;Lene M. Favrholdt;Jens S. Kohrt
Affiliations:
Department of Mathematics, University of Haifa, Haifa, Israel;Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark;Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark
Venue:
Journal of Scheduling
Year:
2012

Citing 15
Cited 3

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
Online algorithms for a dual version of bin packing

Discrete Applied Mathematics
Two simple algorithms for bin covering

Acta Cybernetica
Best-fit bin-packing with random order

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The Ordered Open-End Bin-Packing Problem

Operations Research
Tight bounds for online class-constrained packing

Theoretical Computer Science - Latin American theorotical informatics
The relative worst order ratio for online algorithms

ACM Transactions on Algorithms (TALG)
The relative worst-order ratio applied to paging

Journal of Computer and System Sciences
The class constrained bin packing problem with applications to video-on-demand

Theoretical Computer Science
The relative worst order ratio applied to seat reservation

ACM Transactions on Algorithms (TALG)
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Bincoloring

Theoretical Computer Science
Comparing First-Fit and Next-Fit for Online Edge Coloring

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Fast algorithms for bin packing

Journal of Computer and System Sciences
Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms

List factoring and relative worst order analysis

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Selfish bin coloring

Journal of Combinatorial Optimization
Algorithms for scheduling of chemotherapy plans

Computers in Biology and Medicine

Quantified Score

Hi-index	0.00

Visualization

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.