Skip to main content
SpringerLink
Log in

Improved lower bounds for semi-online bin packing problems

  • Published:
Computing Aims and scope Submit manuscript

Abstract

In the paper we deal with lower bounds constructed for the asymptotic competitive ratio of semi-online bin packing and batched bin packing algorithms.We determine the bounds as the solutions of a related nonlinear optimization problem using theoretical analysis and a reliable numerical global optimization method. Our results improve the lower bounds given in Gutin et al. (Discrete Optim 2:71–82, 2005) for some special cases of the batched bin packing problem.

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. Balogh J, Békési J, Galambos G, Reinelt G (2008) Lower bound for bin packing problem with restricted repacking. SIAM J Comput 38: 398–410

    Article  MathSciNet  Google Scholar 

  2. Coffman EG, Galambos G, Martello S, Vigo D (1999) Bin packing approximation algorithms: combinatorial analysis. In: Du DZ, Pardalos PM (eds) Handbook of Combinatorial Optimization. Kluwer, Dordrecht, pp 151–208

    Google Scholar 

  3. Coffmann EG, Garey MR, Johnson DS (1983) Dynamic bin packing. SIAM J Comput 12: 227–260

    Article  MathSciNet  Google Scholar 

  4. Csirik J, Woeginger GJ (1998) Online packing and covering problems. In: Fiat A, Woeginger GJ (eds) Online algorithms: the state of the art. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, pp 147–177

    Google Scholar 

  5. Epstein L, Levin A (2008) More on online bin packing with two item sizes. Discrete Optim 5(4): 705–713

    Article  MATH  MathSciNet  Google Scholar 

  6. Galambos G, Woeginger GJ (1993) Repacking helps in bounded space online bin packing. Computing 49: 329–338

    Article  MATH  MathSciNet  Google Scholar 

  7. Gambosi G, Postiglione A, Talamo M (2000) Algorithms for the relaxed online bin-packing model. SIAM J Comput 30: 1532–1551

    Article  MATH  MathSciNet  Google Scholar 

  8. Garey MR, Johnson DS (1979) Computers and intractability (A guide to the theory of NP-completeness). W.H. Freeman, San Francisco

    MATH  Google Scholar 

  9. Grove EF (1995) Online bin packing with lookahead. In: Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 430–436

  10. Gutin G, Jensen T, Yeo A (2005) Batched bin packing. Discrete Optim 2: 71–82

    Article  MATH  MathSciNet  Google Scholar 

  11. Gutin G, Jensen T, Yeo A (2006) On-line bin packing with two item sizes. Algorithmic Oper Res 1: 2

    MathSciNet  Google Scholar 

  12. Hammer R, Hocks M, Kulisch U, Ratz D (1993) Numerical toolbox for verified computing I. Springer, Berlin

    MATH  Google Scholar 

  13. Hansen E (1992) Global optimization using interval analysis. Marcel Dekker, New York

    MATH  Google Scholar 

  14. Horst R, Pardalos PM (eds) (1995) Handbook of global optimization. Kluwer, Dordrecht

    MATH  Google Scholar 

  15. Ivkovič Z, Lloyd EL (1996) A fundamental restriction on fully dynamic maintenance of bin packing. Inform Process Lett 59: 229–232

    Article  MATH  MathSciNet  Google Scholar 

  16. Ivkovič Z, Lloyd EL (1998) Fully dynamic algorithms for bin packing: being (mostly) myopic helps. SIAM J Comput 28: 574–611

    Article  MATH  Google Scholar 

  17. Knüppel O (1993) PROFIL—Programmer’s Runtime Optimized Fast Interval Library. Bericht 93.4, Technische Universität Hamburg-Harburg

  18. Markót MCs, Csendes T, Csallner AE (2000) Multisection in interval branch-and-bound methods for global optimization. II. Numerical tests. J Global Optim 16: 219–228

    Article  MATH  MathSciNet  Google Scholar 

  19. Moore RE (1966) Interval analysis. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  20. Seiden SS (2002) On the online bin packing problem. J ACM 49: 640–671

    Article  MathSciNet  Google Scholar 

  21. van Vliet A (1992) An improved lower bound for online bin packing algorithms. Inform Process Lett 43: 277–284

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics’ Applications, Gyula Juhász Faculty of Education, University of Szeged, Boldogasszony sgt. 6, 6725, Szeged, Hungary

    János Balogh, József Békési & Gábor Galambos

  2. Advanced Concepts Team, European Space Agency, ESTEC, Noordwijk, The Netherlands

    Mihály Csaba Markót

  3. Faculty of Mathematics, University of Vienna, Nordbergstr. 15, 1090, Vienna, Austria

    Mihály Csaba Markót

Authors
  1. János Balogh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. József Békési
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gábor Galambos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mihály Csaba Markót
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mihály Csaba Markót.

Additional information

The research was supported by the Hungarian National Research Fund (project T 048377 and T 046822) and by the MÖB-DAAD Hungarian-German Researcher Exchange Program (project No. 21).

M. Cs. Markót is currently supported by the Austrian Science Fund (FWF project P18704-N13).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balogh, J., Békési, J., Galambos, G. et al. Improved lower bounds for semi-online bin packing problems. Computing 84, 139–148 (2009). https://doi.org/10.1007/s00607-008-0023-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-008-0023-6

Keywords

Mathematics Subject Classification (2000)

Search

Navigation