Bin packing with "largest in bottom" constraint: Tighter bounds and generalizations

Research output: Contribution to journalArticle

11 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)416-436
Number of pages21
JournalJournal of Combinatorial Optimization
Volume26
Issue number3
DOIs
Publication statusPublished - Oct 1 2013

Keywords

  • Bin packing
  • Incompatibility graph
  • LIB constraint

ASJC Scopus subject areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Bin packing with "largest in bottom" constraint: Tighter bounds and generalizations'. Together they form a unique fingerprint.

  • Cite this