Expected performance of the shelf heuristic for 2-dimensional packing

Authors:
John J. Bartholdi, III;John H. Vande Vate;Jixian Zhang
Affiliations:
Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA;Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA;Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA
Venue:
Operations Research Letters
Year:
1989

Citing 7
Cited 1

Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The average-case analysis of some on-line algorithms for bin packing

Combinatorica
Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics

Management Science
A probabilistic analysis of multidimensional bin packing problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Probabilistic analysis of some bin-packing problems

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A probabilistic analysis of the next fit decreasing bin packing heuristic

Operations Research Letters
Expected performance of the shelf heuristic for 2-dimensional packing

Operations Research Letters

Expected performance of the shelf heuristic for 2-dimensional packing

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.