Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
Abstract
We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an new bin we have no possibility to pack elements into the earlier opened bins). We give a tight bound for its worst-case and show that this bound is a parameter of the maximal sizes of the items to be packed. Moreover, we also present a probabilistic analysis of this algorithm.
Key words
Two-dimensional packing bin-packing heuristic algorithm worst-case analysis probabilistic analysis on-line algorithmHybrid Next-Fit Algorithmus für das zweidimensionale Rechteck-Packungsproblem
Zusammenfassung
Wir geben einen neuen Näherungs-Algorithmus für das zweidimensionale Packungsproblem an. Er beruht auf zwei eindimensionalen Packungsalgorithmen. Da der Algorithmus von next-fit Typ ist, kann er auch in solchen Fällen benutzt werden, wo die Ausgabe on-line sein muß (d. h. sobald wir einen neuen Behälter eröffnen, haben wir keine Möglichkeit, Elemente in früher geöffnete Behälter zu packen). Wir geben eine gute Schranke im schlechtesten Fall an und zeigen, daß diese Schranke von der Maximalgröße der gepackten Rechtecke abhängt. Schließlich untersuchen wir noch das mittlere Verhalten des Algorithmus.
Preview
Unable to display preview. Download preview PDF.
References
- [1]Baker, B. S., Coffman, E. G.: A tight asymptotic bound for next-fit-decreasing bin packing. SIAM J. Alg. Discr. Meth.2, 147–152 (1981).MathSciNetGoogle Scholar
- [2]Chung, F. R. K., Garey, M. R., Johnson, D. S.: On packing two-dimensional bins. SIAM Alg. Discr. Meth.3, 66–76 (1982).MathSciNetGoogle Scholar
- [3]Coffman, E. G., Garey, M. R., Johnson, D. S., Tarjan, R. E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Computing9, 808–826 (1980).MathSciNetGoogle Scholar
- [4]Csirik, J., Frenk, J. B. G., Frieze, A. M., Galambos, G., Rinnooy Kan, A. H. G.: A probabilistic analysis of the next fit decreasing bin packing heuristic. Operations Research Letters (to appear).Google Scholar
- [5]Garey, M. R., Johnson, D. S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman 1979.Google Scholar
- [6]Johnson, D. S.: Fast algorithms for bin-packing. System Sci.8, 272–314 (1974).MATHGoogle Scholar
- [7]Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., Graham, R. L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Computing3, 256–278 (1974).CrossRefMathSciNetGoogle Scholar
- [8]Kingman, J. F. C.: Subadditive Processes, Lecture Notes in Mathematics. Springer-Verlag, 539, 168–222 (1976).Google Scholar
- [9]Liang, F. M.: Lower bound for on-line bin packing. Information Proc. Lett.10, 76–79 (1980).MATHGoogle Scholar
- [10]Ong, H. L., Magazine, M. J., Wee, T. S.: Probabilistic analysis of bin packing heuristics. Operations Research32, 983–998 (1984).MathSciNetGoogle Scholar