On Two Dimensional Packing
- 30 November 1997
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 25 (2) , 290-310
- https://doi.org/10.1006/jagm.1997.0876
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithmsComputing, 1994
- A better lower bound for on-line schedulingInformation Processing Letters, 1994
- Two-dimensional rectangle packing: on-line methods and resultsDiscrete Applied Mathematics, 1993
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List SchedulingSIAM Journal on Computing, 1993
- New algorithms for an ancient scheduling problemPublished by Association for Computing Machinery (ACM) ,1992
- Multidimensional on-line bin packing: Algorithms and worst-case analysisOperations Research Letters, 1989
- On Packing Two-Dimensional BinsSIAM Journal on Algebraic Discrete Methods, 1982
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- Performance Bounds for Level-Oriented Two-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1980
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966