Bounded space on-line bin packing: Best is better than first

Algorithmica (New York)

Volumn 31, Issue 2, 2001, Pages 115-138

  Csirik, J ^a   Johnson, D S ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Best Fit; Bin packing; First Fit; On line algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PACKING; PROBLEM SOLVING;

BIN PACKING;

BINS;

EID: 0242364713     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0041-7     Document Type: Article

References (31)

1. J. L. Bentley, Software exploratorium: some random thoughts, UNIX Rev. 10(6) (June 1992), 71-77.
2. J. L. Bentley, D. S. Johnson, F. T. Leighton, and C. C. McGeoch, An experimental study of bin packing, in Proc. list Ann. Allerton Conf. on Communication, Control, and Computing, University of Illinois, Urbana,IL, 1983, pp. 51-60.
3. J. L. Bentley, D. S. Johnson, F. T. Leighton, C. C. McGeoch, and L. A. McGeoch, Some unexpected expected behavior results for bin packing, in Proc. 16th Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, New York, 1984, pp. 279-288.
4. E. G. Coffman, Jr., M. Hofri, K. So, and A. C. Yao, A stochastic model for bin packing, Inform, and Control 44 (1980), 105-115.
5. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber, Tight bounds on first fit. Random Structures and Algorithms 10 (1997), 69-101.
6. E. G. Coffman, Jr., and P. W. Shor, Packing in two dimensions: asymptotic average-case analysis of algorithms, Algorithmica 9 (1993), 253-277.
7. J. Csirik, J. B. G. Frenk, A. Frieze, G. Galambos, and A. H. G. Rinnooy Kan, A probabilistic analysis of the next fit decreasing bin packing heuristic, Oper. Res. Lett. 5 (1986), 233-236.
8. J. Csirik and B. Imreh, On the worst-case performance of the NkF bin-packing heuristic, Acta Cybernet. 9 (1989), 89-105.
9. J. Csirik and D. S. Johnson, Bounded space on-line bin packing: best is better than first, in Proc. 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms, Society for Industrial Mathematics, Philadelphia, PA, 1991, pp. 309-319.
10. G. N. Frederickson, Probabilistic analysis for simple one- and two-dimensional bin packing algorithms, Inform. Process. Lett. 11 (1980), 156-161.
11. M. R. Garey, R. L. Graham, D. S. Johnson, and A. C.-C. Yao, Resource constrained scheduling as generalized bin packing, J. Combin. Theory 21 (1976), 257-298.
12. D. S. Johnson, Near-Optimal Bin Packing Algorithms, Doctoral Dissertation, Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA, 1973.
13. D. S. Johnson, Fast algorithms for bin packing, J. Comput. System Sci. 8 (1974), 272-314.
14. 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.
15. N. Karmarkar, Probabilistic analysis for some bin-packing algorithms, in Proc. 23rd Ann. Symp. on Foundations of Computer Science, IEEE Computer Society, Los Angeles, CA, 1982, pp. 107-111.
16. W. Knödel, A bin packing algorithm with complexity O(n log n) and performance l in the stochastic limit, in Proc. 10th Symp. on Mathematical Foundations of Computer Science, J. Gruska and M. Chytil (eds.), Lecture Notes in Computer Science 118, Springer-Verlag, Berlin, 1981, pp. 369-378.
17. D. E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981, Section 3.6.
18. C. C. Lee and D. T. Lee, A new algorithm for on-line bin packing. Report No. 83-03-FC-02, Department of EECS, Northwestern University, Evanston, IL, 1983.
19. C. C. Lee and D. T. Lee, A simple on-line packing algorithm, J. Assoc. Comput. Mach. 32 (1985), 562-572.
20. G. S. Lueker, An average-case analysis of bin packing with uniformly distributed item sizes, Report No. 181, Department of Information and Computer Science, University of California, Irvine, CA, 1982.
21. W. Mao, Tight worse-case performance bounds for next-k-fit bin packing, SIAM J. Comput. 22 (1993), 46-56.
22. W. Mao, Best k-fit bin packing, Computing 50 (1993) 265-270.
23. P. Ramanan, Average-case analysis of the smart next fit algorithm. Inform. Process. Lett. 31 (1989), 221-225.
24. P. Ramanan and K. Tsuga, Average-case analysis of the modified harmonic algorithm, Algorithmica 4 (1989), 519-534.
25. M. B. Richey, Improved bounds for harmonic-based bin packing algorithms, Discrete Appl. Math. 24 (1991), 203-227.
26. P. W. Shor, The average case analysis of some on-line algorithms for bin packing, Combinatorica 6 (1986), 179-200.
27. P. W. Shor, private communication (1990).
28. A. van Vliet, An improved lower bound for on-line bin packing algorithms, Inform. Process. Lett. 43 (1992), 277-284.
29. A. van Vliet, On the asymptotic worst case behavior of harmonic fit, J. Algorithms 20 (1996), 113-136.
30. G. Woeginger, Improved space for bounded-space, on-line bin-packing, SIAM J. Discrete Math. 6 (1993), 575-581.
31. k bin packing, Acta Math. Appl. Sinica (English Ser.) 13 (1997), 443-446.