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.
|Number of pages||5|
|Journal||Operations Research Letters|
|State||Published - 1 Mar 2016|
Bibliographical notePublisher Copyright:
© 2016 Elsevier B.V. All rights reserved.
- Approximation ratio
- Batched problems
- Bin packing
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics