A heuristic for packing boxes into a container

作者： J.A. George , D.F. Robinson

DOI: 10.1016/0305-0548(80)90001-5

关键词: Algorithm 、 Computer hardware 、 Computer science 、 Heuristic 、 Container (type theory)

摘要: Given a container of known dimensions and a collection of rectangular boxes with known dimensions and number of boxes of each type, the problem is to find suitable positions for placing the boxes in the container in such a way that all the boxes can be fitted in. A heuristic for computer or manual operation is described.

参考文章(4)

David S. Johnson, Fast algorithms for bin packing Journal of Computer and System Sciences. ,vol. 8, pp. 272- 314 ,(1974) , 10.1016/S0022-0000(74)80026-7

J. C. Herz, Recursive Computational Procedure for Two-dimensional Stock Cutting IBM Journal of Research and Development. ,vol. 16, pp. 462- 469 ,(1972) , 10.1147/RD.165.0462

Samuel Eilon, Nicos Christofides, The Loading Problem Management Science. ,vol. 17, pp. 259- 268 ,(1971) , 10.1287/MNSC.17.5.259

P. C. Gilmore, R. E. Gomory, Multistage Cutting Stock Problems of Two and More Dimensions Operations Research. ,vol. 13, pp. 94- 120 ,(1965) , 10.1287/OPRE.13.1.94