In this paper we discuss lower bounds for the asymptotic worst case ratio of on-line algorithms for different kind of bin packing problems. Recently, Galambos and Frenk gave a simple proof of the 1.536 ... lower bound for the 1-dimensional bin packing problem. Following their ideas, we present a general technique that can be used to derive lower bounds for other bin packing problems as well. We apply this technique to prove new lower bounds for the 2-dimensional (1.802...) and 3-dimensional (1.974...) bin packing problem.ZusammenfassungIn dieser Arbeit untersuchen wir asymptotische untere Schranken von on-line Algorithmen für verschiedene Arten des Bin-Packungsproblems. Kürzlich haben Galambos und Frenk einen einfachen Beweis der unteren Schranke 1.536... für das eindimensionale Packungsproblem angegeben. Ausgehend von ihren Überlegungen präsentieren wir eine allgemeine Technik zur Herleitung unterer Schranken auch für andere Packungsprobleme. Wir verwenden diese Technik, um neue untere Schranken für das zweidimensionale (1,802...) und das dreidimensionale (1,974...) Packungsproblem zu beweisen.
[1]
David S. Johnson,et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
1978
.
[2]
Gerhard J. Woeginger,et al.
A Lower Bound for On-Line Vector-Packing Algorithms
,
1993,
Acta Cybern..
[3]
Frank M. Liang.
A Lower Bound for On-Line Bin Packing
,
1980,
Inf. Process. Lett..
[4]
J. B. G. Frenk,et al.
A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case
,
1993,
Discret. Appl. Math..
[5]
Gábor Galambos.
A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing
,
1991,
Acta Cybern..
[6]
János Csirik,et al.
An on-line algorithm for multidimensional bin packing
,
1993,
Oper. Res. Lett..
[7]
André van Vliet,et al.
An Improved Lower Bound for On-Line Bin Packing Algorithms
,
1992,
Inf. Process. Lett..
[8]
Michael B. Richey,et al.
Improved bounds for harmonic-based bin packing algorithms
,
1991,
Discret. Appl. Math..