Expected performance of the shelf heuristic for 2-dimensional packing
- 28 February 1989
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 8 (1) , 11-16
- https://doi.org/10.1016/0167-6377(89)90026-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Expected performance of the shelf heuristic for 2-dimensional packingOperations Research Letters, 1989
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing HeuristicsManagement Science, 1988
- A probabilistic analysis of the next fit decreasing bin packing heuristicOperations Research Letters, 1986
- The average-case analysis of some on-line algorithms for bin packingCombinatorica, 1986
- Probabilistic Analysis of Bin Packing HeuristicsOperations Research, 1984
- Shelf Algorithms for Two-Dimensional Packing ProblemsSIAM Journal on Computing, 1983
- A class of simple stochastic online bin packing algorithmsComputing, 1982
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- Two-dimensional packing: expected performance of simple level algorithmsInformation and Control, 1980
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974