Technical note: A note on an open-end bin packing problem

Journal of Scheduling

Volumn 4, Issue 4, 2001, Pages 201-207

  Leung, Joseph Y T ^a   Dror, Moshe ^b   Young, Gilbert H ^c  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithms; Bin packing; Complexity

Indexed keywords

EID: 0346491951     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.75     Document Type: Article

References (11)

1. Cofimann EG, Garey Jr., MR, Johnson DS. Approximation algorithms for bin packing: a survey. In Approximation Algorithms for NP-hard Problems, Hochbaum D (ed.). PWS Publishing Company, 1996.
2. Dror M, Rosenblatt M. Bin packing with overlaps: the stacking dishes case. Working paper, 1979.
3. Assmann SJ, Johnson DS, Kleitman DJ, Leung JY-T. On a dual version of the one-dimensional bin packing problem. Journal of Algorithms 1984; 5:502-525.
4. Karmarkar N, Karp RM. An efficient approximation scheme for the one-dimensional bin packing problem. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society: Long Beach, CA, 1982; 312-320.
5. Richey MB. Improved bounds for harmonic-based bin packing algorithms. Discrete Applied Mathematics 1991; 34:203-227.
6. van Vliet A. Lower and upper bounds for on-line bin packing and scheduling heuristics. PhD Thesis, Erasmus University, Rotterdam, Netherlands, 1995.
7. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company: San Francisco, 1979.
8. Johnson DS. Near-optimal bin packing algorithms. PhD Thesis, Department of Mathematics, Massachusetts Institute of Technology, Cambridge, 1973.
9. Johnson DS. Fast algorithms for bin packing. Journal of Computer and System Sciences 1974; 8:272-314.
10. Garey MR, Graham RL, Ullman JD. Worst-case analysis of memory allocation algorithms. Proceedings of the 4th Annual Symposium on Theory of Computing. ACM: New York, 1972; 143-150.
11. van Vliet A. On the asymptotic worst case behavior of harmonic fit. Journal of Algorithms 1996; 20:113-136.