A new version of on-line variable-sized bin packing

Discrete Applied Mathematics

Volumn 72, Issue 3, 1997, Pages 193-197

  Zhang, Guochuan ^a  

^a NONE

Author keywords

Bin packing; On line algorithm; Worst case analysis

Indexed keywords

EID: 0001240995     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00018-2     Document Type: Article

References (9)

1. B.S. Baker and E.G. Coffman, Jr., A tight asymptotic bound for next-fit-decreasing bin packing, SIAM J. Algebraic Discrete Methods 2 (1981) 147-152.
2. E.G. Coffman Jr., M.R. Garey and D.S. Johnson, Approximation algorithms for bin packing problems: An updated survey, in: Ausiello and Lucertini, eds., Analysis and Design of Algorithms in Combinatorial Optimization (Springer, New York, 1984) 49-106.
3. J. Csirik, An on-line algorithm for variable-sized bin packing, Acta Inform. 26 (1989) 697-709.
4. D.K. Friesen and M.A. Langston, Variable sized bin packing, SIAM J. Comput. 15 (1986) 222-229.
5. G. Galambos and G.J. Woeginger, On-line bin packing - a restricted survey. Z. Oper. Res. 42 (1995) 25-45.
6. D.S. Johnson, Near-optimal bin packing algorithms, Tech. Report MAC TR109, Project MAC, Massachusetts Institute of Technology, Cambridge, Mass (1973).
7. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput. 3 (1974) 299-325.
8. N.G. Kinnersley and M.A. Langston, Online variable-sized bin packing, Discrete Appl. Math. 22 (1988/89) 143-148.
9. G.C. Zhang, Worst-case analysis of the FFH algorithm for on-line variable-sized bin packing, Computing, to appear.