Abstract
We revisit the batched bin packing problem. In this model, items come in K consecutive batches, and the items of the earlier batches must be packed without any knowledge of later batches. We give the first approximation algorithm for the case \(K=2\), with tight asymptotic approximation ratio of 1.5833, while the known lower bound of the model is 1.378. With the application of this result, we are also able to provide an improved algorithm for the recently defined graph-bin packing problem in a special case, where we improve the upper bound from 3 to 2.5833.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balogh, J., Bekesi, J., & Galambos, G. (2012). New lower bounds for certain classes of bin packing algorithms. Theoretical Computer Science, 440–441, 1–13.
Balogh, J., Bekesi, J., Dosa, G., Galambos, G., & Tan Z. (2015) Lower bound for 3-batched bin packing, manuscript.
Bujtas, Cs, Dosa, G., Imreh, Cs, Nagy-György, J., & Tuza, Zs. (2011). The graph-bin packing problem. International Journal of Foundations of Computer Science, 22(8), 1971–1993.
Coffman, E. G, Jr, Garey, M., & Johnson, D. S. (1996). Approximation algorithms for bin packing: A survey. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46–93). Boston, MA: PWS Publishing Co.
de la Vega, W. F., & Lueker, G. S. (1981). Bin packing can be solved within \(1+\varepsilon \) in linear time. Combinatorica, 1, 349–355.
Dosa, G., Li, R., Han, X., & Tuza, Zs. (2013). Tight absolute bound for first fit decreasing bin-packing: \(FFD(L)\le 11/9\) \(OPT(L)+6/9\). Theoretical Computer Science, 510, 13–61.
Dósa, G., & Sgall, J. (2013). First fit bin packing: A tight analysis. In: Proceedings of the 30th annual symposium on theoritical aspects of computer science (STACS), LIPIcs, Schloss Dagstuhl (vol. 3, pp. 538–549).
Dósa, G., & Sgall, J. (2014). Optimal analysis of best fit bin packing. In J. Esparza, et al. (Eds.), ICALP 2014, Part I. LNCS (Vol. 8572, pp. 429–441). Heidelberg: Springer.
Epstein, L., & Levin, A. (2008). On bin packing with conflicts. SIAM Journal on Optimization, 19(3), 1270–1298.
Garey, M. R., & Johnson, D. S. (1979). Computer and intractability: A guide to the theory of NP-completeness. New York: Freeman.
Gutin, G., Jensen, T., & Yeo, A. (2005). Batched bin packing. Discrete Optimization, 2, 71–82.
Jansen, K. (1999). An approximation scheme for bin packing with conflicts. Journal of Combinatorial Optimization, 3(4), 363–377.
Johnson, D.S. (1973). Near-optimal bin-packing algorithms. Doctoral 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, C. C., & Lee, D. T. (1985). A simple on-line packing algorithm. Journal of the ACM, 32, 562–572.
Seiden, S. (2002). On the online bin packing problem. Journal of the ACM, 49(5), 640–671.
van Vliet, A. (1992). An improved lower bound for on-line bin packing algorithms. Information Processing Letters, 43(5), 277–284.
Acknowledgments
The author would like to thank to both referees for their comments and useful suggestions. These helped improve the clarity of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by the financial support of the Hungarian State and the European Union under the TAMOP-4.2.2.A-11/1/ KONV-2012-0072.
Rights and permissions
About this article
Cite this article
Dosa, G. Batched bin packing revisited. J Sched 20, 199–209 (2017). https://doi.org/10.1007/s10951-015-0431-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-015-0431-3