Abstract
The study on one-dimensional bin packing problem may bring about many important applications such as multiprocessor scheduling, resource allocating, real-world planning and packing. Harmonic algorithms (including H K, RH, etc.) for bin packing have been famous for their linear-time and on-line properties for a long time. This paper profoundly analyzes the average-case performance of harmonic algorithms for pieces of i.i.d. sizes, provides the average-case performance ratio of H K under (0,d] (d ≤ 1) uniform distribution and the average-case performance ratio of RH under (0,1] uniform distribution. We also finished the discussion of the worst-case performance ratio of RH. Moreover, we propose a new improved version of RH that obtains better worst- and average-case performance ratios.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.G. Coffman, M.R. Garey, and D.S. Johnson, “Approximation algorithms for bin Packing: A survey,” in Approximation Algorithms for NP-Hard Problems, D. Hochbaum (Ed.), PWS Publishing: Boston, 1996, pp. 46–93.
E.G. Coffman, Jr., D.S. Johnson, P.W. Shor, and R.R. Weber, “Bin packing with discrete item sizes, Part II: Tight bounds on first fit,” Random Structures and Algorithms, vol. 10, pp. 69–101, 1996.
E.G. Coffman, Jr., K. So, M. Hofri, and A.C. Yao, “A stochastic model of bin packing,” Int. and Cont., vol. 44, pp. 105–115, 1980.
Csirik and D.S. Johnson, “Bounded space on-line bin packing: Best is better than first,” in Proceedings, 2nd Annual ACM-SIAM Symposium on Discrete, Algorithms. Society for Industrial and Applied Mathematics: Philadelphia, PA, 1991, pp. 309–319.
Csirik, D.S. Johnson C. Kenyon, J.B. Orlin, P.W. Shor, and R.R. Weber, “On the sum-of-square algorithm for bin packing,” in Proc. 2000 ACM Symp. on Theory of Computing, 2000, pp. 208–217.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guild to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1978.
D.S. Johnson, “Near-optimal bin packing algorithms,” Ph.D. Thesis, Massachusetts Institute of Technology, Department of Mathematics, Cambridge, 1973.
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., vol. 3, pp. 299–325, 1974.
N. Karmarkar, “Probabilistic analysis of some bin-packing algorithms,” in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 107–111.
N. Karmarkar and R.M. Karp, “An efficient approximation scheme for the one-dimensional bin packing problem,” in Proc. 23rd Ann. Symp. on Foundations of Computer Science, IEEE Computer Soc., Silver Spring, MD, 1982, pp. 312–320.
C.C. Lee and D.T. Lee, “A simple on-line bin-packing algorithm,” Journal of the ACM, vol. 32, no. 3, pp. 562–572, 1985.
W.T. Rhee and M. Talagrand, “Some distributions that allow perfect packing,” Assoc. Comp. Mach., vol. 35, pp. 564–578, 1988.
A. van Vliet, “Lower and upper bounds for on-line bin packing and scheduling heuristic,” Ph.D. Thesis, Erasmus University, Rotterdam, Netherlands, 1995.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gu, X., Chen, G., Gu, J. et al. Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms. Journal of Combinatorial Optimization 6, 455–471 (2002). https://doi.org/10.1023/A:1019577921700
Issue Date:
DOI: https://doi.org/10.1023/A:1019577921700