Abstract
The (online) bin packing problem with LIB constraint is stated as follows: The items arrive one by one, and must be packed into unit capacity bins, but a bigger item cannot be packed into a bin which already contains a smaller item. The number of used bins has to be minimized as usually. We show that the absolute performance bound of algorithm First Fit is not worse than 2+1/6≈2.1666 for the problem, improving the previous best upper bound 2.5. Moreover, if the item sizes do not exceed 1/d, then we improve the previous best result 2+1/d to 2+1/d(d+2), for any d≥2. (Both previously best results are due to Epstein, Nav. Res. Logist. 56(8):780–786, 2009.) Furthermore, we define a problem with the generalized LIB constraint, where some incoming items cannot be packed into the bins of some already packed items. The (in)compatibility of the incoming item with the items already packed becomes known only at the arrival of the actual item, and is given by an undirected graph (and, as usual in case of online graph problems, we can see only that part of the graph what already arrived). We show that 3 is an upper bound for this general problem if some natural transitivity constraint is satisfied.
Similar content being viewed by others
References
Baker KA, Fishburn PC, Roberts FS (1971) Partial orders of dimension 2. Networks 2(1):11–28
Bean DR (1976) Effective coloration. J Symb Log 41(2):469–480
Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge
Coffman E Jr, Garey M, Johnson D (1996) Approximation algorithms for bin packing: a survey. In: Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, pp 46–93
Dosa G (2007) The tight bound of bin packing algorithm FFD is FFD(I) < = 11/9 OPT(I) + 6/9. In: Lecture Notes in Computer Sciences, vol 4614, ESCAPE 2007. Springer, Berlin, pp 1–11
Dosa G, Tuza Zs, Ye D (2010) Better bounds for the bin packing problem with LIB constraint. In: Proc Conf MATCOS-10. Press of University of Primorska
Dushnik B, Miller EW (1941) Partially ordered sets. Am J Math 63(3):600–610
Epstein L (2009) On online bin packing with LIB constraints. Nav Res Logist 56(8):780–786
Epstein L, Levin A (2007) On bin packing with conflicts. In: Proceedings of workshop on approximation and online algorithms, pp 160–173
Epstein L, Levin A, van Stee R (2007) Multi-dimensional packing with conflicts. In: Fundamentals of computation theory. Lecture notes in computer science, vol 4639. Springer, Berlin, pp 288–299
Finlay L, Manyem P (2005) Online LIB problems: heuristics for bin covering and lower bounds for Bin Packing. RAIRO Rech Opér 39:163–183
Gyárfás A, Lehel J (1998) On-line and first fit colorings of graphs. J Graph Theory 12(2):217–227
Jansen K (1999) An approximation scheme for bin packing with conflicts. J Comb Optim 3(4):363–377
Jansen K, Öhring S (1997) Approximation algorithms for time constrained scheduling. Inf Comput 132:85 C108
Johnson D, Demers A, Ullman J, Garey M, Graham R (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3:25–278
Lund C, Yannakakis M (1993) On the hardness of approximating minimization problem. In: 25th Symposium on the theory of computing, pp 286–293
Manyem P (2003) Uniform sized bin packing and covering: online version. In: Misra JC (ed) Topics in industrial mathematics. Narosa Publishing House, New Delhi, pp 447–485
Manyem P, Salt R, Visser M (2003) Approximation lower bounds in online LIB bin packing and covering. J Autom Lang Comb 8(4):663–674
McCloskey B, Shankar A (2005) Approaches to bin packing with clique-graph conflicts. Technical Report UCB/CSD-05-1378, EECS Department, University of California, Berkeley
Seiden S (2002) On the online bin packing problem. J ACM 49(5):640–671
van Vliet A (1992) An improved lower bound for on-line bin packing algorithms. Inf Process Lett 43(5):277–284
Xia BZ, Tan ZY (2010) Tighter bounds of the First Fit algorithm for the bin-packing problem. Discrete Appl Math 158(15):1668–1675
Author information
Authors and Affiliations
Corresponding author
Additional information
Zs. Tuza supported in part by the Hungarian Scientific Research Fund, OTKA grant 81493.
D. Ye supported in part by research grant NSFC(11071215).
Rights and permissions
About this article
Cite this article
Dosa, G., Tuza, Z. & Ye, D. Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations. J Comb Optim 26, 416–436 (2013). https://doi.org/10.1007/s10878-011-9408-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9408-0