On-line maximizing the number of items packed in variable-sized bins

Leah Epstein, Lene M. Favrholdt

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

Abstract

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 (Formula Presented).

Original languageEnglish
Title of host publicationComputing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings
EditorsOscar H. Ibarra, Louxin Zhang
PublisherSpringer Verlag
Pages467-475
Number of pages9
ISBN (Print)354043996X, 9783540439967
DOIs
StatePublished - 2002
Externally publishedYes
Event8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore
Duration: 15 Aug 200217 Aug 2002

Publication series

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

Conference

Conference8th Annual International Conference on Computing and Combinatorics, COCOON 2002
Country/TerritorySingapore
CitySingapore
Period15/08/0217/08/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

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