Skip to main content
SpringerLink
Log in

Repacking helps in bounded space on-line bind-packing

Beim Bounded Space On-line Bin-Packing kann Umpacken von Vorteil sein

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We consider a version of the on-line bounded-space bin-packing problem where repacking the items within the active bins is allowed. For this problem, the 1.69103 lower bound of Lee and Lee [7] for the worst case ratios of bounded-space approximation algorithms still applies. We present a polynomial time approximation algorithm that reaches the best possible worst case ratio matching the Lee and Lee lower bound while using onlythree active bins.

Zusammenfassung

Wir behandeln eine Variante des On-Line Bound-Space Bin-Packings, in der das Umpacken der Gegenstände innerhalb der aktiven Bins erlaubt ist. Auch für diese Variante gilt die untere Schranke 1.69103, die Lee und Lee [7] für Worst Case Ratios von Bounded-Space Approximations-Algorithmen bewiesen haben. Wir konstruieren einen bestmöglichen polynomialen Approximations-Algorithmus, der die Schranke von Lee und Lee erreicht und dazu nurdrei aktive Bins verwendet.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Csirik, J., Imreh, B.: On the worst-case performance of the NkF bin-packing heuristic. Acta Cybernetica9, 89–105 (1989).

    Google Scholar 

  2. Csirik, J., Johnson, D. S.: Bounded space on-line bin packing: Best ist better than First. Proc. 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, January 1991.

  3. Garey, M. R., Graham, R. L., Johnson, D. S., Yao, A. C. C.: Resource constrained scheduling as generalized bin packing. J. Comb. Th. Ser. A.21, 257–298 (1976).

    Google Scholar 

  4. Golomb, S.: On certain non-linear recurring sequences. American Math. Monthly70, 403–405 (1963).

    Google Scholar 

  5. Johnson, D. S.: Fast algorithms for bin packing. J. Comput. System Sci.8, 272–314 (1974).

    Google Scholar 

  6. 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. Comput.3, 256–278 (1974).

    Google Scholar 

  7. Lee, C. C., Lee, D. T.: A simple on-line bin-packing algorithm. J. Assoc. Comput. Mach.32, 562–572 (1985).

    Google Scholar 

  8. Woeginger, G. J.: Improved space for bounded-space on-line bin-packing. Technical Report No. 187, TU Graz, 1991.

Download references

Author information

Authors and Affiliations

  1. Department of Applied Computer Sciences, József Attila University, Árpád tér 2, H-6720, Szeged, Hungary

    G. Galambos

  2. Institut für Mathematik B, TU Graz, Kopernikusgasse 24, A-8010, Graz, Austria

    G. J. Woeginger

Authors
  1. G. Galambos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. J. Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This paper was supported by a grant from the Hungarian Academy of Sciences (OTKA Nr. 2037).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Galambos, G., Woeginger, G.J. Repacking helps in bounded space on-line bind-packing. Computing 49, 329–338 (1993). https://doi.org/10.1007/BF02248693

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02248693

AMS Subject Classifications

Key words

Search

Navigation