Skip to main content
SpringerLink
Log in

FFD bin packing for item sizes with uniform distributions on [0, 1/2]

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We study the expected behavior of the FFD bin-packing algorithm applied to items whose sizes are distributed in accordance with a Poisson process with rateN on the interval[0, 1/2] of item sizes. By viewing the algorithm as a succession of queueing processes we show that the expected wasted space for FFD bin-packing is bounded above by 11.3 bins, independent ofN.

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.

Similar content being viewed by others

References

  1. J. L. Bentley, D. S. Johnson, F. T. Leighton, and C. C. McGeoch, An experimental study of bin packing,Proc. 21st Ann. Allerton Conf. on Communication, Control, and Computing, University of Illinois, Urbana, Ill, pp. 51–60, 1983.

    Google Scholar 

  2. J. L. Bentley, D. S. Johnson, F. T. Leighton, C. C. McGeoch, and L. A. McGeoch, Some Unexpected Expected Behavior Results for Bin Packing,Proc 16th Ann. Symp. on Theory of Computing, pp. 279–288, 1984.

  3. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, Approximation Algorithms for Bin-Packing—An Updated Survey, inAlgorithm Design for Computer System Design, G. Ausiello, M. Lucertini, and P. Serafini (eds.), Springer-Verlag, New York, pp. 49–106, 1984.

    Google Scholar 

  4. E. G. Coffman, Jr., G. S. Lueker, and A. H. G. Rinnooy Kan, Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics,Management Science,35, p. 266, 1988.

    Article  MathSciNet  Google Scholar 

  5. H. T. Davis,Tables of the Mathematical Functions, Principia Press of Trinity University, Vol. I, pp. 333, 336, Vol. II, pp. 34, 1935.

    Google Scholar 

  6. G. N. Frederickson, Probabilistic Analysis for Simple One- and Two-Dimensional Bin- Packing Algorithms,Information Processing Letters,11 (4–5), pp. 156–161, December 1980.

    Article  MATH  MathSciNet  Google Scholar 

  7. E. R. Hansen,A Table of Series and Products, Prentice Hall, Englewood Cliffs, NJ, p. 108, 1975.

    MATH  Google Scholar 

  8. L. Kleinrock,Queueing Systems, Wiley, New York, Vol. I, pp. 15–19, 251–253, Vol. II, pp. 32–34, 1975.

    MATH  Google Scholar 

  9. G. S. Lueker, An Average-Case Analysis of Bin Packing with Uniformly Distributed Item Sizes, Report No. 181, Department of Information and Computer Science, University of California, Irvine, CA, 1982.

    Google Scholar 

  10. A. McLellan, Riemann Zeta Function, Unpublished manuscript, Lawrence Berkeley Laboratories Main Library, 1972.

  11. S. M. Ross,Stochastic Processes, Wiley, New York, pp. 46–53, 82–84, 1983.

    MATH  Google Scholar 

  12. R. W. Wolff, Private Communication, 1986, 1987.

Download references

Author information

Authors and Affiliations

  1. Lawrence Berkeley Laboratory, 94720, Berkeley, CA, USA

    Sally Floyd

  2. Department of Computer Science, University of California, 94720, Berkeley, CA, USA

    Richard M. Karp

Authors
  1. Sally Floyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard M. Karp
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by David S. Johnson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Floyd, S., Karp, R.M. FFD bin packing for item sizes with uniform distributions on [0, 1/2]. Algorithmica 6, 222–240 (1991). https://doi.org/10.1007/BF01759043

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation