Institute of Informatics
Acta Cybernetica
Past Issues
Volume 16, Number 1, 2003
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
# On-Line Maximizing the Number of Items Packed in Variable-Sized Bins

**Leah Epstein and Lene M. Favrholdt**

### Abstract (in LaTeX format)

We study an on-line bin packing problem. A fixed number $n$ of bins, possibly of different sizes, are given. The items arrive on-line, and the goal is to pack as many items as possible. It is known that there exists a legal packing of the whole sequence in the $n$ bins. We consider fair algorithms that reject an item, only if it does not fit in the empty space of any bin. We show that the competitive ratio of any fair, deterministic algorithm lies between $\frac12$ and $\frac23$, and that a class of algorithms including Best-Fit has a competitive ratio of exactly $\frac{n}{2n-1}$.

**Keywords: ** on-Line, bin packing.

### Full text

Available electronic editions: PDF.

### DOI

DOI is not available for this article.

### BibTeX entry
`
@article{Epstein_2:2003:ActaCybernetica,`

author = {Leah Epstein and Lene M. Favrholdt},

title = {On-Line Maximizing the Number of Items Packed in Variable-Sized Bins},

journal = {Acta Cybernetica},

year = {2003},

volume = {16},

number = {1},

pages = {57--66},

abstract = {We study an on-line bin packing problem. A fixed number $n$ of bins, possibly of different sizes, are given. The items arrive on-line, and the goal is to pack as many items as possible. It is known that there exists a legal packing of the whole sequence in the $n$ bins. We consider fair algorithms that reject an item, only if it does not fit in the empty space of any bin. We show that the competitive ratio of any fair, deterministic algorithm lies between $\frac12$ and $\frac23$, and that a class of algorithms including Best-Fit has a competitive ratio of exactly $\frac{n}{2n-1}$.},

keywords = {on-Line, bin packing}

}