Skip to main content
SpringerLink
Log in

On-Line Algorithms for Cardinality Constrained Bin Packing Problems

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2001)

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

Included in the following conference series:

Abstract

The bin packing problem asks for a packing of a list of items from [0, 1] into the smallest possible number of bins having unit capacity. The k-item bin packing problem additionally imposes the constraint that at most k items are allowed in one bin. We present two efficient approximation algorithms for the on-line version of this problem. We show that, for increasing values of k, the asymptotic worst-case performance ratio of the first algorithm tends towards 2 and that the second algorithm has an asymptotic worst-case performance ratio of 2. Both heuristics considerably improve upon the best known result 2.7 of Krause, Shen and Schwetman. Moreover, we present algorithms for k = 2 and k = 3, where the result for k = 2 is best possible.

Supported by the Deutsche Forschungsgemeinschaft

Supported by the ESRC Management Research Fellowship.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Galambos G., Woeginger G. J.: On-line bin packing-a restricted survey. ZOR-Mathematical Methods of Operations Research 42 (1995) 25–45

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Krause K. L., Shen V. Y., Schwetman H. D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM 22 (1975) 522–550

    Article  MathSciNet  MATH  Google Scholar 

  4. Krause K. L., Shen V. Y., Schwetman H. D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, Errata. Journal of the ACM 24 (1977) 527

    Article  MATH  Google Scholar 

  5. Lee C. C., Lee D. T.: A simple on-line bin packing algorithm. Journal of the ACM 32 (1985) 562–572

    Article  MathSciNet  MATH  Google Scholar 

  6. Van Vliet A.: An improved lower bound for on-line bin packing algorithms. Information Processing Letters 43 (1992) 277–284

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Technische Universität München, D-80290, München, Germany

    Luitpold Babel

  2. Warwick Business School, University of Warwick, CV4 7AL, Coventry, UK

    Bo Chen

  3. Institut für Statistik und Operations Research, Universität Graz Universitätsstraße 15, A-8010, Graz, Austria

    Hans Kellerer

  4. Faculty of Applied Mathematics and Computer Science, University of Minsk, 220080, Minsk, Belarus

    Vladimir Kotov

Authors
  1. Luitpold Babel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bo Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hans Kellerer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vladimir Kotov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Basser Department of Computer Science, University of Sydney, Madsen Building F09, 2006, Sydney, NSW, Australia

    Peter Eades

  2. Department of Computer Science, University of Canterbury, Private Bag 4800, Christchurch, New Zealand

    Tadao Takaoka

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Babel, L., Chen, B., Kellerer, H., Kotov, V. (2001). On-Line Algorithms for Cardinality Constrained Bin Packing Problems. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-45678-3_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42985-2

  • Online ISBN: 978-3-540-45678-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation