Fair versus unrestricted bin packing

Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2000
Subtitle of host publication7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5–7, 2000 Proceedings
EditorsMagnús M. Halldórsson
PublisherSpringer Verlag
Pages200-213
Number of pages14
ISBN (Print)3540676902, 9783540676904
DOIs
StatePublished - 2000
Event7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 - Bergen, Norway
Duration: 5 Jul 20007 Jul 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1851
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th Scandinavian Workshop on Algorithm Theory, SWAT 2000
Country/TerritoryNorway
CityBergen
Period5/07/007/07/00

Fingerprint

Dive into the research topics of 'Fair versus unrestricted bin packing'. Together they form a unique fingerprint.

Cite this