Skip to main content
SpringerLink
Log in

Semi-on-line bin packing: a short overview and a new lower bound

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

Here we review the main results in the area of semi-on-line bin packing. Then we present a new lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows the optimum value in advance.

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

Fig. 1

Similar content being viewed by others

References

  • Balogh J, Békési J (2012) An Improved Lower Bound for a Semi-on-line Bin Packing Problem. In: Fourth International Workshop on Bin Packing and Placement Constraints (BPPC’12), Nantes, France

  • Balogh J, Békési J (2010) Semi-on-line bin packing: an overview and an improved lower bound. In: Proceedings of the (2010) mini-conference on applied theoretical computer science (MATCOS-10), pp 69–74. Koper, Slovenia

  • Balogh J, Békési J, Galambos G (2012) New lower bounds for certain bin packing algorithms. Theor Comput Sci 440–441:1–13

    Article  Google Scholar 

  • Balogh J, Békési J, Galambos G, Markót MC (2009) Improved lower bounds for semi-on-line bin packing problems. Computing 84:139–148

    Article  Google Scholar 

  • 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  Google Scholar 

  • Balogh J, Békési J, Galambos G , Reinelt G (2010) On a multidimensional semi-online bin packing problem. In: Proceedings of the 8th international conference on applied informatics, vol. 2, pp 191–197

  • Balogh J, Békési J, Galambos G, Reinelt G (2012) On-line bin packing with restricted repacking. J Comb Optim. doi:10.1007/s10878-012-9489-4

  • Chan JW-T, Lam T-W, Wong PWH (2008) Dynamic bin packing of unit fractions items. Theor Comput Sci 409:521–529

    Article  Google Scholar 

  • Coffman EG, Galambos G, Martello S, Vigo D (1999) Bin packing approximation algorithms: combinatorial analysis. In: Handbook of combinatorial optimization supplement volume. Kluwer Academic Publishers

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

    Article  Google Scholar 

  • Coppersmith D, Raghavan P (1989) Multidimensional on-line bin packing: algorithms and worst-case analysis. Oper Res Lett 8:17–20

    Article  Google Scholar 

  • Csirik J, Galambos G, Turán G (1983) Some results on bin packing. In: Proceedings of EURO VI, Vienna

  • Csirik J, Woeginger GJ (1998) On-line packing and covering problems. In: On-line algorithms. Lecture Notes in Computer Science, vol. 1442, Berlin, pp 147–177

  • Dósa G (2007) The tight bound of first fit decreasing bin-packing algorithm is \(FFD(I )<= 11/9 (I) +6/9\). In: Proceedings of ESCAPE, pp 1–11

  • Epstein L, Kleiman E (2009) Resource augmented semi-online bounded space bin packing. Discrete Appl Math 157:2785–2798

    Article  Google Scholar 

  • Epstein L, Levin A (2009) A robust APTAS for the classical bin packing problem. Math Program 119:33–49

    Article  Google Scholar 

  • Epstein L, Levin A (2008) On bin packing with conflicts. SIAM J Optim 19:1270–1298

    Article  Google Scholar 

  • Epstein L, Levy M (2010) Dynamic multi-dimensional bin packing. J Discrete Algorithms 8:356–372

    Article  Google Scholar 

  • Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within \(1+\varepsilon \) in linear time. Combinatorica 1:349–355

    Article  Google Scholar 

  • Galambos G (1985) A new heurisic for the classical bin packing problem. Technical report 82. Institute für Mathematik, Augsburg

  • Galambos G, van Vliet A (1994) Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms. Computing 52:281–297

    Article  Google Scholar 

  • Galambos G, Woeginger GJ (1993) Repacking helps in bounded space on-line bin packing. Computing 49:329–338

    Article  Google Scholar 

  • Gambosi G, Postiglione A, Talamo M (1990) New algorithms for on-line bin packing. In: Algorithms and complexity, Proceedings of the iirst Italian conference, World Scientific, Singapore, pp 44–59

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

    Article  Google Scholar 

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

    Google Scholar 

  • Grove EF (1995) On-line bin packing with lookahead. In: Proceedings of SODA, pp 430–436

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

    Article  Google Scholar 

  • Gutin G, Jensen T, Yeo A (2006) Optimal on-line bin packing with two item sizes. Algorithmic Oper Res 1:72–78

    Google Scholar 

  • Han X, Peng C, Ye D, Zhang D, Lan Y (2010) Dynamic bin packing with unit fraction items revisited. Inf Process Lett 110:1049–1054

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Ivkovič Z, Lloyd E (1997) Partially dynamic bin packing can be solved within \(1+\varepsilon \) in (amortized) polylogarithmic time. Inf Process Lett 63:45–50

    Article  Google Scholar 

  • Johnson DS (1973) Near-optimal bin packing algorithms. PhD thesis. MIT, Cambridge

  • Karmarkar N, Karp R (1982) An efficient approximation scheme for the one-dimensional bin packing problem. In: Proceedings of the 23rd annual symposium on foundations of computer science (FOCS’82), pp 312–320

  • Lee CC, Lee DT (1985) A simple on-line bin packing algorithm. J ACM 32:562–572

    Article  Google Scholar 

  • Ramanan P, Brown DJ, Lee CC, Lee DT (1989) On-line bin packing in linear time. J Algorithms 10:305–326

    Article  Google Scholar 

  • Richey MB (1991) Improved bounds for harmonic-based bin packing algorithms. Discrete Appl Math 34:203–227

    Article  Google Scholar 

  • Seiden SS (2002) On the on-line bin packing problem. J ACM 49:640–671

    Article  Google Scholar 

  • van Vliet A (1992) An improved lower bound for on-line bin packing algorithms. Inf Process Lett 43: 277–284

    Google Scholar 

Download references

Acknowledgments

The authors thank the anonymous referees for their valuable comments that contributed to improve the presentation of this paper. The authors thank Gábor Galambos for suggesting the problem.

Author information

Authors and Affiliations

  1. Department of Applied Informatics, Gyula Juhász Faculty of Education, University of Szeged, POB 396, 6701 , Szeged, Hungary

    János Balogh & József Békési

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

Corresponding author

Correspondence to János Balogh.

Additional information

This study was supported by the by HSC-DAAD Hungarian-German Research Exchange Programme (Project P-MÖB/837) and Gyula Juhász Faculty of Education, University of Szeged (Project CS-001/2010).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balogh, J., Békési, J. Semi-on-line bin packing: a short overview and a new lower bound. Cent Eur J Oper Res 21, 685–698 (2013). https://doi.org/10.1007/s10100-012-0266-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-012-0266-3

Keywords

Search

Navigation