Fair versus Unrestricted Bin Packing.

Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, and Morten N. Nielsen.
In 7th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1851 of Lecture Notes in Computer Science, pages 200-213. Springer, 2000.

We consider the Unrestricted Bin Packing problem where we have bins of equal size and a sequence of items. The goal is to maximize the number of items that are packed in the bins by an on-line algorithm. We investigate the power of performing admission control on the items, i.e., rejecting items while there is enough space to pack them, versus behaving fairly, i.e., rejecting an item only when there is not enough space to pack it. We show that by performing admission control on the items, we get better performance for various measures compared with the performance achieved on the fair version of the problem. Our main result shows that we can pack 2/3 of the items for sequences in which the optimal can pack all the items.

---

publication

Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any): The final publication is available at link.springer.com.

full version

Link to the journal version containing all the material and proofs, some of which are usually omitted in the conference version due to space constraints.

other publications

Other publications by the author.