Batched bin packing

Authors:
Gregory Gutin;Tommy Jensen;Anders Yeo
Affiliations:
Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK;Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK;Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK
Venue:
Discrete Optimization
Year:
2005

Citing 11
Cited 3

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
On the performance of on-line algorithms for partition problems

Acta Cybernetica
Does randomization help in on-line bin packing?

Information Processing Letters
An improved lower bound for on-line bin packing algorithms

Information Processing Letters
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Partially dynamic bin packing can be solved within 1 + &egr; in (amortized) polylogarithmic time

Information Processing Letters
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps

SIAM Journal on Computing
Online bin packing with lookahead

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
New Algorithms for Bin Packing

Journal of the ACM (JACM)
An on-line bin-batching problem

Discrete Applied Mathematics
On-line Packing and Covering Problems

Developments from a June 1996 seminar on Online algorithms: the state of the art

Resource augmented semi-online bounded space bin packing

Discrete Applied Mathematics
More on online bin packing with two item sizes

Discrete Optimization
On-line bin packing with restricted repacking

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.