Three-dimensional packings with rotations

Computers and Operations Research

Volumn 36, Issue 10, 2009, Pages 2801-2815

  Miyazawa, F K ^a   Wakabayashi, Y ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Approximation algorithms; Orthogonal rotations; Packing problems

Indexed keywords

BINS; PACKING; ROTATION; THREE DIMENSIONAL;

ASYMPTOTIC PERFORMANCE; BIN-PACKING PROBLEMS; GENERAL VERSIONS; ORTHOGONAL ROTATIONS; PACKING PROBLEMS; STRIP PACKING PROBLEMS; THREE-DIMENSIONAL PACKINGS;

APPROXIMATION ALGORITHMS;

EID: 62549106561     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.12.015     Document Type: Article

References (25)

1. Coffman E.G., Garey Jr. M.R., and Johnson D.S. Approximation algorithms for bin packing-an updated survey. In: Ausiello G., Lucertini M., and Serafini P. (Eds). Algorithms design for computer system design (1984), Springer, New York 49-106
2. Li K., and Cheng K.-H. Static job scheduling in partitionable mesh connected systems. Journal of Parallel and Distributed Computing 10 (1990) 152-159
3. Johnson DS. Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA; 1973.
4. Kenyon C., and Rémila E. A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research 25 (2000) 645-656
5. Chung F.R.K., Garey M.R., and Johnson D.S. On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods 3 (1982) 66-76
6. Caprara A. Packing 2-dimensional bins in harmony. Proceedings of the 43rd symposium on foundations of computer science (2002) 490-499
7. Bansal N., Correa J.R., Kenyon C., and Sviridenko M. Bin packing in multiple dimensions: inapproximability results and approximation schemes. Mathematics of Operations Research 31 1 (2006) 31-49
8. Miyazawa F.K., and Wakabayashi Y. An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica 18 1 (1997) 122-144
9. Jansen K., and Solis-Oba R. An asymptotic approximation algorithm for 3D-strip packing. Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (2006) 143-152
10. Bansal N., Han X., Iwama K., Sviridenko M., and Zhang G. Harmonic algorithm for 3-dimensional strip packing problem. Proceedings of the of the 18th annual ACM-SIAM Symposium on discrete algorithms (2007) 1197-1206
11. Li K, Cheng K-H. A generalized harmonic algorithm for on-line multidimensional bin packing. TR UH-CS-90-2, University of Houston; January 1990.
12. Csirik J., and van Vliet A. An on-line algorithm for multidimensional bin packing. Operations Research Letters 13 (1993) 149-158
13. Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations. In: Proceedings of the 6th Latin American theoretical informatics, Buenos Aires, Argentina, Lecture notes in computer science, vol. 2976. Berlin: Springer; 2004. p. 359-68.
14. Epstein L., and van Stee R. This side up!. ACM Transactions on Algorithms 2 2 (2006) 228-243
15. Jansen K., and van Stee R. On strip packing with rotations. Proceedings of the 37th ACM symposium on theory of computing (2005)
16. Miyazawa F.K., and Wakabayashi Y. Approximation algorithms for the orthogonal z-oriented 3-D packing problem. SIAM Journal on Computing 29 3 (2000) 1008-1029
17. Epstein L. Two dimensional packing: the power of rotation. In: Proceedings of the 28th international symposium of mathematical foundations of computer science, Lecture notes on computer science, vol. 2747. Berlin: Springer; 2003. p. 398-407.
18. Coffman EG, Garey Jr. MR, Johnson DS. Approximation algorithms for bin packing: a survey. In: D. Hochbaum, editor, Approximation algorithms for NP-hard problems, PWS, 1997. p. 46-93 [chapter 2].
19. Coffman E.G., Garey Jr. M.R., Johnson D.S., and Tarjan R.E. Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing 9 (1980) 808-826
20. Bansal N., and Sviridenko M. New approximability and inapproximability results for 2-dimensional bin packing. Proceedings of the 15th ACM-SIAM symposium on discrete algorithms (2004) 189-196
21. Fernandez de la Vega W., and Lueker G.S. Bin packing can be solved within 1 + ε{lunate} in linear time. Combinatorica 1 4 (1981) 349-355
22. Li K., and Cheng K.-H. On three-dimensional packing. SIAM Journal on Computing 19 (1990) 847-867
23. Miyazawa F.K., and Wakabayashi Y. Two- and three-dimensional parametric packing. Computers and Operations Research 34 (2007) 2589-2603
24. Miyazawa F.K., and Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research 150 (2003) 281-292
25. Miyazawa F.K., and Wakabayashi Y. Cube packing. Theoretical Computer Science 297 (2003) 355-366