The Ordered Open-End Bin-Packing Problem

References

  • Coffman E. G., Lueker G. S.Probabilistic Analysis of Packing and Partitioning Algorithms (1991) (John Wiley and Sons, New York) Google Scholar
  • Coffman E. G., Garey M. R., Johnson D. S., Hochbaum D. Approximation algorithms for bin packing: A survey. Approximation Algorithms for NP-hard Problems (1996) (PWS Publishing Company, Boston, MA) Google Scholar
  • Csirik J., Frenk J. B. G., Galambos G., Rinnooy Kan A. H. G. Probabilistic analysis of algorithms for dual bin packing problems. J. Algorithms (1991) 12:189–203CrossrefGoogle Scholar
  • Johnson D. S., Demers A., Ullman J. D., Garey M. R., Graham R. L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. (1974) 3(4):299–325CrossrefGoogle Scholar
  • Karmarkar N. Probabilistic analysis of some bin-packing algorithms. Proc. 23rd Annual Sympos. on Foundations of Comput. Sci. (1982) (IEEE Computer Society Press Los, Alamitos, CA) 107–111Google Scholar
  • Knodel W. A bin packing algorithm with complexity O(nlog n) and performance 1 in the stochastic limit. Lecture Notes Comput. Sci. (1981) 118:369–378 http://www.springer.de/comp/lncs/CrossrefGoogle Scholar
  • Leung J. Y.-T., Dror M., Young G. H. A note on an openend bin packing problem. J. Scheduling (2001) 4:201–207CrossrefGoogle Scholar
  • Liang F. M. A lower bound for on-line bin packing. Inform. Processing Lett. (1980) 10:76–79CrossrefGoogle Scholar
  • Loulou R. Probabilistic behavior of optimal bin-packing solutions. Oper. Res. Lett. (1984) 3(3):129–135CrossrefGoogle Scholar
  • Patel J. K., Read C. B.Handbook of the Normal Distribution (1982) (Marcel Dekker, New York) CrossrefGoogle Scholar
  • Steele J. M.Probability Theory and Combinatorial Optimization (1997) (Society for Industrial and Applied Mathematics, Philadelphia, PA) CrossrefGoogle Scholar
  • Van Vliet A. Lower and upper bounds for on-line bin packing and scheduling heuristics. (1995) . Ph.D. thesis, Erasmus University, Rotterdam, The NetherlandsGoogle Scholar
  • Van Vliet A. On the asymptotic worst case behavior of harmonic fit. J. Algorithms (1996) 20:113–136CrossrefGoogle Scholar
  • Yao A. C. New algorithms for bin packing. J. ACM (1980) 27:207–227CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.