E. G. Cooman, J. , and G. S. Lueker, Probabilistic Analysis of Packing and Partitioning Algorithms, 1991.

D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, Worst-case performance b ounds for simple one-dimensional packing algorithms, SIAM J. on Computing, vol.3, pp.229-325, 1974.

P. W. Shor, The average-case analysis of some on-line algorithms for bin packing. C o m binatorica, vol.6, pp.179-200, 1986.

A. C. Yao, New algorithms in bin packing, J A CM, vol.27, pp.207-227, 1980.

M. Frank and . Liang, A lower bound for on-line bin-packing, IPL, vol.10, 1980.

F. Galambos, A simple proof of Liang's lower bound for online packing and the extension to the parametric case, Discrete Applied Math, vol.41, pp.173-178, 1993.

A. V. Vliet, An improved lower bound for on-line bin packing algorithms, IPL, vol.43, pp.277-284, 1992.

K. Clarkson, D. Comput, and . Geometry,

B. Chandra, Does randomization help in on-line bin-packing?, I P L 4, vol.3, pp.15-19, 1992.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: a guide to the theo r y o f N P -c ompleteness. F reeman & Co, 1979.

C. C. Lee and D. T. Lee, A simple on-line packing algorithm, J A CM, vol.32, pp.562-572, 1985.

D. S. Johnson, Fast algorithms for bin-packing, vol.8, pp.272-314, 1974.

P. Ramanan, D. J. Brown, C. C. Lee, and D. T. Lee, On-line bin-packing in linear time, J. Alg, vol.10, pp.305-326, 1989.

M. B. Richey, Improved b ounds for reened harmonic bin packing, unpublished, 1990.

E. G. Cooman, D. S. Johnson, P. W. Shor, and R. R. Weber, Markov chains, computer proofs, and average-case analysis of best--t bin packing, pp.412-421, 1993.