1. Brown, D. J. A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana-Champaign, 1979.
2. Chandra, B. Does randomization help in on-line bin packing? Information Processing Letters 43, 1 (Aug 1992), 15–19.
3. Coffman, E. G., Garey, M. R., AND Johnson, D. S. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, D. Hochbaum, Ed. PWS Publishing Company, 1997, ch. 2.
4. Csirik, J. An on-line algorithm for variable-sized bin packing. Acta Informatica 26, 8 (1989), 697–709.
5. Lect Notes Comput Sci;J. Csirik,1998