Two-dimensional on-line bin packing problem with rotatable items

Theoretical Computer Science

Volumn 289, Issue 2, 2002, Pages 939-952

  Fujita, Satoshi ^a   Hada, Takeshi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

On line algorithm; Rotation of items; Two dimensional bin packing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; PROBLEM SOLVING;

ON-LINE ALGORITHMS;

COMPUTER SCIENCE;

EID: 0037202091     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00410-8     Document Type: Conference Paper

References (7)

1. D. Blitz, A. van Vliet, G.J. Woeginger, Lower bounds on the asymptotic worst-case ratio of on-line bin packing algorithms, 1996, unpublished manuscript.
2. Coppersmith D., Raghavan P. Multidimensional on-line bin packing. algorithms and worst case analysis Oper. Res. Lett. 8:1989;17-20.
3. Csirik J., van Vliet A. An on-line algorithm for multidimensional bin packing. Oper. Res. Lett. 13:1993;149-158.
4. Garey M.R., Johnson D.S. Computers and Intractability: A Guide for the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
5. Lee C.C., Lee D.T. A simple on-line bin packing algorithm. J. Assoc. Comput. Mach. 32:1985;562-572.
6. Richey M.B. Improved bounds for harmonic-based bin packing algorithms. Discrete Appl. Math. 34:1991;203-227.
7. Van Vliet A. An improved lower bound for on-line bin packing algorithms. Inform. Process. Lett. 43:1992;277-284.