Skip to main content
SpringerLink
Log in

A 17/10-approximation algorithm fork-bounded space on-line variable-sized bin packing

  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

A version of thek-bounded space on-line bin packing problem, where a fixed collection of bin sizes is allowed, is considered. By packing large items into appropriate bins and closing appropriate bins, we can derive an algorithm with worst-case performance bound 1.7 fork≥3.

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. D.K. Friesen and M.A. Langston. Variable Sized Bin Packing.SIAM J. on Comput., 1986, 15: 222–229.

    Article  MATH  Google Scholar 

  2. N.G. Kinnersley and M.A. Langston. On-line Variable-Sized Bin Packing.Discrete Applied Mathematics, 1988/89, 22:143–148.

    Article  Google Scholar 

  3. J. Csirik. An On-Line Algorithm for Variable-Sized Bin Packing.Acta Informatica, 1989, 26: 697–709.

    Article  MATH  Google Scholar 

  4. J. Csirik and D.S. Johnson. Bounded Space On-Line Bin Packing: Best is Better than First. The Proceedings of 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 1991, 309–319.

  5. W. Mao. Tight Worst-Case Performance Bounds For Next-K-Fit Bin Packing.SIAM J. on Comput., 1993, 22: 46–56.

    Article  Google Scholar 

  6. W. Mao. Best-K-Fit Bin Packing.Computing,1993, 50: 265–270.

    Article  MATH  Google Scholar 

  7. G. Zhang and M. Yue. Tight Performance Bound ofAFB k Bin Packing.Acta Math. Appl. Sinica, 1997, 13(4): 443–446.

    Article  MATH  Google Scholar 

  8. G. Zhang. Worst-Case Analysis of theFFH Algorithm for On-Line Variable-Sized Bin Packing.Computing, 1996, 56: 165–172.

    Article  MATH  Google Scholar 

  9. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham. Worst-Case Performance Bounds for Simple One-dimensional Packing Algorithms.SIAM J. on Comput., 1974, 3: 299–325.

    Article  Google Scholar 

  10. R. Burkard and G. Zhang.K-bound Space On-line Variable-sized Bin Packing.Acta Cybernetica, 1997, 13: 63–76.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Advanced Mathematics, Zhejiang University, 310027, Hangzhou, China

    Zhang Guochuan

Authors
  1. Zhang Guochuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research is supported by the Science Foundation under State Education Committee of China.

The earlier version was done in Institute of Applied Mathematics, Academia Sinica.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guochuan, Z. A 17/10-approximation algorithm fork-bounded space on-line variable-sized bin packing. Acta Mathematicae Applicatae Sinica 14, 74–79 (1998). https://doi.org/10.1007/BF02677351

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation