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

Leah Epstein; Lene M. Favrholdt

doi:10.1007/3-540-45655-4_50

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

Leah Epstein, Lene M. Favrholdt

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings
Editors	Oscar H. Ibarra, Louxin Zhang
Publisher	Springer Verlag
Pages	467-475
Number of pages	9
ISBN (Print)	354043996X, 9783540439967
DOIs	https://doi.org/10.1007/3-540-45655-4_50
State	Published - 2002
Externally published	Yes
Event	8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore Duration: 15 Aug 2002 → 17 Aug 2002

Publication series

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

Conference

Conference	8th Annual International Conference on Computing and Combinatorics, COCOON 2002
Country/Territory	Singapore
City	Singapore
Period	15/08/02 → 17/08/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45655-4_50

Cite this

Epstein, L., & Favrholdt, L. M. (2002). On-line maximizing the number of items packed in variable-sized bins. In O. H. Ibarra, & L. Zhang (Eds.), Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings (pp. 467-475). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2387). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_50

Epstein, Leah ; Favrholdt, Lene M. / On-line maximizing the number of items packed in variable-sized bins. Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. editor / Oscar H. Ibarra ; Louxin Zhang. Springer Verlag, 2002. pp. 467-475 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e4ccf9771cee4ea49cb9b660346bae03,

title = "On-line maximizing the number of items packed in variable-sized bins",

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).",

author = "Leah Epstein and Favrholdt, {Lene M.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 8th Annual International Conference on Computing and Combinatorics, COCOON 2002 ; Conference date: 15-08-2002 Through 17-08-2002",

year = "2002",

doi = "10.1007/3-540-45655-4_50",

language = "English",

isbn = "354043996X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "467--475",

editor = "Ibarra, {Oscar H.} and Louxin Zhang",

booktitle = "Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings",

address = "Germany",

}

Epstein, L & Favrholdt, LM 2002, On-line maximizing the number of items packed in variable-sized bins. in OH Ibarra & L Zhang (eds), Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2387, Springer Verlag, pp. 467-475, 8th Annual International Conference on Computing and Combinatorics, COCOON 2002, Singapore, Singapore, 15/08/02. https://doi.org/10.1007/3-540-45655-4_50

On-line maximizing the number of items packed in variable-sized bins. / Epstein, Leah; Favrholdt, Lene M.
Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. ed. / Oscar H. Ibarra; Louxin Zhang. Springer Verlag, 2002. p. 467-475 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2387).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Epstein, Leah

AU - Favrholdt, Lene M.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

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

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

UR - http://www.scopus.com/inward/record.url?scp=84887258186&partnerID=8YFLogxK

U2 - 10.1007/3-540-45655-4_50

DO - 10.1007/3-540-45655-4_50

M3 - Conference contribution

AN - SCOPUS:84887258186

SN - 354043996X

SN - 9783540439967

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 467

EP - 475

BT - Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings

A2 - Ibarra, Oscar H.

A2 - Zhang, Louxin

PB - Springer Verlag

T2 - 8th Annual International Conference on Computing and Combinatorics, COCOON 2002

Y2 - 15 August 2002 through 17 August 2002

ER -

Epstein L, Favrholdt LM. On-line maximizing the number of items packed in variable-sized bins. In Ibarra OH, Zhang L, editors, Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. Springer Verlag. 2002. p. 467-475. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45655-4_50

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

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this