On-Line Maximizing the Number of Items Packed in Variable-Sized Bins

Leah Epstein, Lene Monrad Favrholdt

Research output: Contribution to journalJournal articleResearchpeer-review


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 1 2 and 2 3, and that a class of algorithms including Best-Fit has a competitive ratio of exactly n 2n-1.
Original languageEnglish
JournalActa Cybernetica
Pages (from-to)57-66
Number of pages10
Publication statusPublished - 2003


Dive into the research topics of 'On-Line Maximizing the Number of Items Packed in Variable-Sized Bins'. Together they form a unique fingerprint.

Cite this