Shelf Algorithms for Two-Dimensional Packing Problems
- 1 August 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (3) , 508-525
- https://doi.org/10.1137/0212033
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A two-dimensional bin-packing model of preemptive, FIFO storage allocationJournal of Algorithms, 1982
- A 54 algorithm for two-dimensional packingJournal of Algorithms, 1981
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-PackingSIAM Journal on Algebraic Discrete Methods, 1981
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- Performance Bounds for Level-Oriented Two-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1980
- A lower bound for on-line bin packingInformation Processing Letters, 1980
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Bounds for Multiprocessor Scheduling with Resource ConstraintsSIAM Journal on Computing, 1975
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- Some Doubly Exponential SequencesThe Fibonacci Quarterly, 1973