Skip to main content
Springer Nature Link
Log in

An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1853))

Included in the following conference series:

  • 1308 Accesses

Abstract

An online algorithm for variable-sized bin packing, based on the Harmonic algorithm of Lee and Lee [11], is investigated. This algorithm is based on one proposed by Csirik [4]. It is shown that the algorithm is optimal among those which use bounded space. An interesting feature of the analysis is that, although it is shown that our algorithm achieves a performance ratio arbitrarily close to the optimum value, it is not known precisely what that value is. The case where bins of capacity 1 and α ∈ (0,1) are used is studied in greater detail. It is shown that among algorithms which are allowed to chose α, the optimal performance ratio lies in [1.37530,1.37532].

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brown, D.J. A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana-Champaign, 1979.

    Google Scholar 

  2. Burkard, R., AND Zhang, G. Bounded space on-line variable-sized bin packing. Acta Cybernetica 13,1 (1997), 63–76.

    MATH  MathSciNet  Google Scholar 

  3. Coffman, E. G., Garey, M. R., AND Johnson, D.S. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, D. Hochbuam, Ed. PWS Publishing Company, 1997, ch. 2.

    Google Scholar 

  4. Csirik, J. An on-line algorithm for variable-sized bin packing. Acta Informatica 26,8 (1989), 697–709.

    Article  MATH  MathSciNet  Google Scholar 

  5. Csirik, J., AND Woeginger, G. On-line packing and covering problems. In On-Line Algorithms—The State of the Art, A. Fiat and G. Woeginger, Eds., Lecture Notes in Computer Science. Springer-Verlag, 1998, ch. 7.

    Google Scholar 

  6. Friesen, D. K., AND Langston, M. A. Variable sized bin packing. SIAM Journal on Computing 15 (1986), 222–230.

    Google Scholar 

  7. Johnson, D.S.Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1973.

    Google Scholar 

  8. Johnson, D.S. Fast algorithms for bin packing. Journal Computer Systems Science 8 (1974), 272–314.

    MATH  Google Scholar 

  9. Johnson, D.S., Demers, A., Ullman, J. D., Garey, M. R., andGraham, R. L.. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3 (1974), 256–278.

    Article  MathSciNet  Google Scholar 

  10. Kinnersley, N., AND Langston, M. Online variable-sized bin packing. Discrete Applied Mathematics 22,2 (Feb1989), 143–148.

    Article  Google Scholar 

  11. Lee, C., AND Lee, D. A simple on-line bin-packing algorithm. Journal of the ACM 32,3 (Jul1985), 562–572.

    Article  MATH  Google Scholar 

  12. Liang, F.M. A lower bound for online bin packing. Information Processing Letters 10 (1980), 76–79.

    Article  MATH  MathSciNet  Google Scholar 

  13. Ramanan, P., Brown, D., Lee, C., AND Lee, D. On-line bin packing in linear time. Journal of Algorithms 10,3 (Sep 1989), 305–326.

    Article  MATH  MathSciNet  Google Scholar 

  14. Richey, M. B. Improved bounds for harmonic-based bin packing algorithms. Discrete Applied Mathematics 34 (1991), 203–227.

    Article  MATH  MathSciNet  Google Scholar 

  15. Van Vliet, A. An improved lower bound for online bin packing algorithms. Information Processing Letters 43,5 (Oct 1992), 277–284.

    Google Scholar 

  16. Yao, A. C.C. New algorithms for bin packing. Journal of the ACM 27 (1980), 207–227.

    Article  Google Scholar 

  17. Zhang, G. Worst-case analysis of the FFH algorithm for online variable-sized bin packing. Computing 56,2 (1996), 165–172.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Louisiana State University, 298 Coates Hall, Baton Rouge, LA, 70803

    Steven S. Seiden

Authors
  1. Steven S. Seiden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, University of Pisa, Corso Italia, 40, 56125, Pisa, Italy

    Ugo Montanari

  2. Center for Computer Sciences, University of Geneva, 24, Rue Général Dufour, 1211, Geneva 4, Switzerland

    José D. P. Rolim

  3. Department of Computer Sciences, ETH Zurich, 8092, Zurich, Switzerland

    Emo Welzl

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seiden, S.S. (2000). An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45022-X_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67715-4

  • Online ISBN: 978-3-540-45022-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation