Abstract
In this paper we study the online bin packing with buffer and bounded size, i.e., there are items with size within \((\alpha ,1/2]\) where \(0 \le \alpha < 1/2 \), and there is a buffer with constant size. Each time when a new item is given, it can be stored in the buffer temporarily or packed into some bin, once it is packed in the bin, we cannot repack it. If the input is ended, the items in the buffer should be packed into bins too. In our setting, any time there is at most one bin open, i.e., that bin can accept new items, and all the other bins are closed. This problem is first studied by Zheng et al. (J Combin Optim 30(2):360–369, 2015), and they proposed a 1.4444-competitive algorithm and a lower bound 1.3333 on the competitive ratio. We improve the lower bound from 1.3333 to 1.4230, and the upper bound from 1.4444 to 1.4243.
Similar content being viewed by others
References
Balogh J, Békési J, Galambos G (2012) New lower bounds for certain classes of bin packing algorithms. Theor Comput Sci 440–441:1–13
Coffman EG, Garey JMR, Johnson DS (1996) Approximation algorithms for bin-packing: a survey. In: Hochbaumed DS (ed) Approximation algorithms of NP-hard problems. PWS Publishing Company, Boston
Ding N, Lan Y, Chen X, Dsa G, Guo H, Han X (2014) Online Minimum makespan scheduling with a buffer. Int J Found Comput Sci 25(5):525–536
Dosa G, Tuza Z, Ye DS (2013) Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations. J Combin Optim 26(3):416–436
Eisemann K (1957) The trim problem. Manag Sci 3(3):279–284
Epstein L, Levin A (2008) More on online bin packing with two item sizes. Discret Optim 5(4):705–713
Gutin G, Jensen T, Yeo A (2006) Optimal on-line bin packing with two item sizes. Algorithm Oper Res 1(2):72–78
Han X, Peng C, Ye D, Zhang DH, Lan Y (2010) Dynamic bin packing with unit fraction items revisited. Inf Process Lett 110(23):1049–1054
Johnson DS (1974) Fast algorithms for bin packing. J Comput Syst Sci 8(3):272–314
Lee CC, Lee DT (1985) A simple on-line bin-packing algorithm. J ACM 32(3):562–572
Ramanan P, Brown DJ, Lee CC, Lee DT (1989) On-line bin packing in linear time. J Algorithm 10(3):305–326
Seiden SS (2002) On the online bin packing problem. J ACM 49(5):640–671
Yao ACC (1980) New algorithms for bin packing. J ACM 27(2):207–227
Zheng FF, Luo L, Zhang E (2015) NF-based algorithms for online bin packing with buffer and bounded item size. J Combin Optim 30(2):360–369
Acknowledgments
This work was partially supported by NSFC (11571060), RGC (HKU716412E), the Fundamental Research Funds for the Central Universities (DUT15LK10).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, M., Han, X., Lan, Y. et al. Online bin packing problem with buffer and bounded size revisited. J Comb Optim 33, 530–542 (2017). https://doi.org/10.1007/s10878-015-9976-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-015-9976-5