More on online bin packing with two item sizes
Authors:
- 1 November 2008
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 5 (4) , 705-713
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Batched bin packingDiscrete Optimization, 2005
- A Polynomial Algorithm for Multiprocessor Scheduling with Two Job LengthsMathematics of Operations Research, 2001
- The Parametric Behavior of the First-Fit Decreasing Bin Packing AlgorithmJournal of Algorithms, 1993
- Does randomization help in on-line bin packing?Information Processing Letters, 1992
- On-line bin packing in linear timeJournal of Algorithms, 1989
- A simple on-line bin-packing algorithmJournal of the ACM, 1985
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-PackingSIAM Journal on Algebraic Discrete Methods, 1981
- A lower bound for on-line bin packingInformation Processing Letters, 1980
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974