Bounded space on-line variable-sized bin packing

Acta Cybernetica

Volumn 13, Issue 1, 1997, Pages 63-76

  Burkard, Rainer E ^a   Zhang, Guochuan ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Approximation algorithm; Bin packing; On line

Indexed keywords

EID: 0005822268     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. E.G. Coffman, Jr, M.R. Garey and D.S. Johnson, Approximation Algorithms for Bin Packing: An Updated Survey. In Analysis and Design of Algorithms in Combinatorial Optimization, Ausiello and Lucertini (eds), Springer, New York, 49-106 (1984).
2. J. Csirik, An On-Line Algorithm for Variable-Sized Bin Packing. Acta Informatica 26, 697-709 (1989).
3. J. Csirik and B. Imreh, On the Worst-Case Performance of the NkF Bin Packing Heuristic. Acta Cybernetica 9, 89-105 (1989).
4. J. Csirik and D.S. Johnson, Bounded Space On-Line Bin Packing: Best is Better than First. The Proceedings of 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 309-319 (1991).
5. D.K. Friesen and M.A. Langston, Variable Sized Bin Packing. SIAM J. Comput. 15, 222-229 (1986).
6. G. Galambos and G.J. Woeginger, Repacking Helps in Bounded Space On-Line Bin Packing, Computing 49, 329-338 (1993).
7. G. Galambos and G.J. Woeginger, On-Line Bin Packing - A Restricted Survey. Zeitschrift für Operations Research 42, 25-45 (1995).
8. D.S. Johnson, Fast Algorithms for Bin Packing. J. Comput. System Sci. 8, 272-314 (1974).
9. N.G. Kinnersley and M.A. Langston, Online Variable-Sized Bin Packing. Discrete Applied Mathematics 22, 143-148 (1988/89).
10. C.C. Lee and D.T. Lee, A Simple On-Line Bin Packing Algorithm, J. Assoc. Comput. Mach. 32, 562-572 (1985).
11. W. Mao, Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing. SIAM J. on Computing, 22, 46-56 (1993).
12. W. Mao, Best-k-Fit Bin Packing. Computing 50, 265-270 (1993).
13. F.D. Murgolo, An Efficient Approximation Scheme for Variable-Sized Bin Packing. SIAM. J. Comput. 16, 149-161 (1987).
14. G.J. Woeginger, Improved Space for Bounded Space On-Line Bin Packing Algorithms, SIAM J. Discr. Math. 6, 575-581 (1993).
15. k Bin Packing. Technical Report No. 015 in Inst. of Appl. Math., Academia Sinica (1994). To appear in Acta Mathematicae Applicatae Sinica.
16. G.C. Zhang, Worst-Case Analysis of the FFH Algorithm for On-Line Variable-Sized Bin Packing. Computing 56, 165-172 (1996).