More on batched bin packing

Research output: Contribution to journalArticlepeer-review


Bin packing is the problem of partitioning a set of items into subsets of total sizes at most 1. In batched bin packing, items are presented in k batches, such that the items of a batch are presented as a set, to be packed before the next batch. In the disjunctive model, an algorithm must use separate bins for the different batches. We analyze the asymptotic and absolute approximation ratios for this last model completely, and show tight bounds as a function of k.

Original languageEnglish
Pages (from-to)273-277
Number of pages5
JournalOperations Research Letters
Issue number2
StatePublished - 1 Mar 2016

Bibliographical note

Publisher Copyright:
© 2016 Elsevier B.V. All rights reserved.


  • Approximation ratio
  • Batched problems
  • Bin packing

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'More on batched bin packing'. Together they form a unique fingerprint.

Cite this