Batched bin packing revisited

Research output: Contribution to journalArticle

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)199-209
Number of pages11
JournalJournal of Scheduling
Issue number2
Publication statusPublished - Apr 1 2017


  • Batched bin packing
  • Graph-bin packing
  • Tight bound

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Management Science and Operations Research
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Batched bin packing revisited'. Together they form a unique fingerprint.

  • Cite this