Expected performance of the shelf heuristic for 2-dimensional packing

The shelf heuristic is an on-line algorithm to pack oriented rectangles into an open-ended bin of unbounded height. The heuristic uses space effectively by partitioning the bin into ‘shelves’ into which rectangles of nearly equal heights are packed. We analyze the expected performance of the shelf h...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 8; no. 1; pp. 11 - 16
Main Authors Bartholdi, John J., Vande Vate, John H., Zhang, Jixian
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 1989
Elsevier
Subjects
Applied sciences
Exact sciences and technology
expected performance
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
packing problems
expected performance
packing problems
Bin packing problem
NP complete problem
Partition method
Algorithm
Heuristic method
Combinatory problem
Online AccessGet full text

Cover

More Information
Summary:The shelf heuristic is an on-line algorithm to pack oriented rectangles into an open-ended bin of unbounded height. The heuristic uses space effectively by partitioning the bin into ‘shelves’ into which rectangles of nearly equal heights are packed. We analyze the expected performance of the shelf heuristic when the dimensions of the rectangles are identically and independently distributed according to a uniform distribution on (0, 1]. In addition, we discuss how to choose the shelf sizes to optimize expected performance.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(89)90026-6