Abstract
In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf 1 andf 2 be two linear combinations of random variables {N i } k i=1 where theN i 's have a joint multinomial distribution for eachn=σ k i=1 ,N i . LetE(f 1) ≠ O andE(f 2)≠ 0. Then limn →∞E(max(f 1,f 2 ))/n = lim n →∞ max(E(f 1),E(f 2))/n. We then consider the special case when the item sizes are uniformly distributed over (0,1]. For specific values of the parameters, the Modified Harmonic algorithm turns out to be better than the other two linear-time on-line algorithms—Next Fit and Harmonic—in both the worst case as well as the average case. We also obtain optimal values for the parameters of the algorithm from the average-case standpoint. For these values of the parameters, the average-case performance ratio is less than 1.19. This compares well with the performance ratios 1.333. and 1.2865. of the Next Fit algorithm and the Harmonic algorithm, respectively.
Similar content being viewed by others
References
Angluin, D., and Valiant, L. G., Fast probabilistic algorithms for Hamiltonian paths and matchings,3. Comput. System Sci. 18 (1979), 155–193.
Bentley, J. L., Johnson, D. S., Leighton, F. T., McGeoch, C. C., and McGeoch, L. A., Some unexpected expected behavior results for bin packing,Proc. 16th Ann. ACM Symp. on Theory of Computing, May 1984, pp. 279–288.
Chernoff, H., A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,Ann. of Math. Statist. 23 (1952), 493–507.
Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., Approximation algorithms for bin packing—an updated survey, inAlgorithm Design for Computer System Design, G. Ausiello, M. Lucertini, and P. Serafini, editors, Springer-Verlag, New York, 1984.
Coffman, E. G., Jr., So, K., Hofri, M., and Yao, A. C., A stochastic model of bin packing,Inform, and Control 44 (1980), 105–115.
Frederickson, G. N., Probabilistic analysis for simple one- and two-dimensional bin-packing algorithms,Inform. Process. Lett. 11 (1980), 156–161.
Garey, M. R., and Johnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
Johnson, D. S., Near-optimal bin-packing algorithms, Technical Report MAC TR-109, Project MAC, Massachusetts Institute of Technology, Cambridge, MS, 1973.
Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L., Worst-case performance bounds for simple one-dimensional packing algorithms,SIAMJ. Comput. 3 (1974), 299–325.
Karmarkar, N., Probabilistic analysis of some bin-packing problems,Proc. 23rd Ann. IEEE Symp. on Foundations of Computer Science, November 1982, pp. 107–111.
Karmarkar, N., and Karp, R. M., An efficient approximation scheme for the one-dimensional bin-packing problem,Proc. 23rd Ann. IEEE Symp. on Foundations of Computer Science, November 1982, pp. 312–320.
Lee, C. C., and Lee, D. T., A new algorithm for one-line bin packing, Technical Report 83-03-FC-02, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 1983.
Lee, C. C., and Lee, D. T., A simple on-line packing algorithm,J. Assoc. Comput. Mach. 32 (1985), 562–572.
Ramanan, P., Brown, D. J., Lee, C. C., and Lee, D. T., On-line bin packing in linear time,J. Algorithms, submitted.
Author information
Authors and Affiliations
Additional information
Communicated by Andrew C. Yao.
Rights and permissions
About this article
Cite this article
Ramanan, P., Tsuga, K. Average-case analysis of the Modified Harmonic algorithm. Algorithmica 4, 519–533 (1989). https://doi.org/10.1007/BF01553906
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01553906