We introduce and study the batched bin packing problem (BBPP), a bin packing problem in which items become available for packing incrementally, one batch at a time. A batched algorithm must pack a batch before the next batch becomes known. A batch may contain several items; the special case when each batch consists of merely one item is the well-studied on-line bin packing problem. We obtain lower bounds for the asymptotic competitive ratio of any algorithm for the BBPP with two batches. We believe that our main lower bound is optimal and provide some support to this conjecture. We suggest studying BBPP and other batched problems.
The main problems of incremental scheduling for bin packing was investigated by Gutin et al, who presented the lower bound for the asymptotic competitive ratio of any algorithm REF .
Batched Bin Packing
Discret. Optim.
Discret. Optim.
Computer Science Mathematics