Fair versus Unrestricted Bin Packing
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
Proceedings of the Seventh Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 1851: 200-213, Springer-Verlag, 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.

Last modified: March 24, 2000.
Kim Skak Larsen (kslarsen@imada.sdu.dk)


   Data protection at SDUDatabeskyttelse på SDU