TY - GEN

T1 - Fair versus Unrestricted Bin Packing

AU - Azar, Yossi

AU - Boyar, Joan

AU - Favrholdt, Lene Monrad

AU - Larsen, Kim Skak

AU - Nielsen, Morten N.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-44985-X

DO - 10.1007/3-540-44985-X

M3 - Article in proceedings

T3 - Lecture Notes in Computer Science

SP - 200

EP - 213

BT - Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory

Y2 - 5 July 2000 through 7 July 2000

ER -