New bounds for variable-sized online bin packing

Steven S. Seiden; Rob Van Stee; Leah Epstein

doi:10.1137/S0097539702412908

New bounds for variable-sized online bin packing

Steven S. Seiden, Rob Van Stee, Leah Epstein

Research output: Contribution to journal › Article › peer-review

Abstract

In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some fixed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present new algorithms for this problem and show upper bounds for them which improve on the best previous upper bounds. We also show the first general lower bounds for this problem. The case in which bins of two sizes, 1 and α ℓ (0, 1), are used is studied in detail. This investigation leads us to the discovery of several interesting fractal-like curves.

Original language	English
Pages (from-to)	455-469
Number of pages	15
Journal	SIAM Journal on Computing
Volume	32
Issue number	2
DOIs	https://doi.org/10.1137/S0097539702412908
State	Published - Feb 2003
Externally published	Yes

Keywords

Bin packing
Online algorithms

ASJC Scopus subject areas

Computer Science (all)
Mathematics (all)

Access to Document

10.1137/S0097539702412908

Cite this

@article{58915568d8fd426b805d0488e43e1ebd,

title = "New bounds for variable-sized online bin packing",

abstract = "In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some fixed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present new algorithms for this problem and show upper bounds for them which improve on the best previous upper bounds. We also show the first general lower bounds for this problem. The case in which bins of two sizes, 1 and α ℓ (0, 1), are used is studied in detail. This investigation leads us to the discovery of several interesting fractal-like curves.",

keywords = "Bin packing, Online algorithms",

author = "Seiden, {Steven S.} and {Van Stee}, Rob and Leah Epstein",

year = "2003",

month = feb,

doi = "10.1137/S0097539702412908",

language = "English",

volume = "32",

pages = "455--469",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - New bounds for variable-sized online bin packing

AU - Seiden, Steven S.

AU - Van Stee, Rob

AU - Epstein, Leah

PY - 2003/2

Y1 - 2003/2

N2 - In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some fixed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present new algorithms for this problem and show upper bounds for them which improve on the best previous upper bounds. We also show the first general lower bounds for this problem. The case in which bins of two sizes, 1 and α ℓ (0, 1), are used is studied in detail. This investigation leads us to the discovery of several interesting fractal-like curves.

AB - In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some fixed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present new algorithms for this problem and show upper bounds for them which improve on the best previous upper bounds. We also show the first general lower bounds for this problem. The case in which bins of two sizes, 1 and α ℓ (0, 1), are used is studied in detail. This investigation leads us to the discovery of several interesting fractal-like curves.

KW - Bin packing

KW - Online algorithms

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

U2 - 10.1137/S0097539702412908

DO - 10.1137/S0097539702412908

M3 - Article

AN - SCOPUS:0038624377

SN - 0097-5397

VL - 32

SP - 455

EP - 469

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

New bounds for variable-sized online bin packing

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this