References
- ALBANO. A., and ORSINI , R. 1979 , A heuristic solution of the rectangular cutting stock problem. The Computer . Journal , 23 , 338 .
- BENGTSSON , B. 1982 , Pracking rectangular pieces—A heuristic approach . The Computer Journal , 25 , 353 .
- BENTLEY , J. L. , 1980 , Preliminary description of an algorithm and program for allocation of VLSI designs to mulliproject chips . C M U Working Paper .
- BENTLEY , J. L. , HAKEN , D. , and HON , R. W. , 1980 . Statistics on VLSI designs . C M U Working Paper ., CMU-CS-80-III .
- Box , G. E. P. , HUNTER , W. G. and HUNTER , J. S. , 1978 . Statistics for experimenters ( New York John Wiley ), pp. 208 – 244 .
- COFFMAN , E. G. , GAREY , M. R. , JOHNSON , D. S. , and TARJAN , R. E. 1980 , Performance bounds for level-oriented two-dimensional packing algorithms SIAM.Journal of Computing , 9 , 808 .
- GAREY , M. R. , and JOHNSON , D. S. , 1980 , Approximation algorithms for bin packing problems A survey . Bell Laboratories Working Paper .
- GAREY , M. R. , and JOHNSON , D. S. , 1979 , Computers and intractibility A guide to the theory of NP-completeness ( San Francisco Freeman ), pp. 124 – 127 .
- HINXMAN , A. I. , 1980 . The trim loss and assortment problems A survey. European Journal of Operational Research , 5 , 8 .
- HODGSON , T. J. , 1982 , A combined approach to the pallet loading problem , IIE Transactions , 14 , 175 .
- ISRANI , S. , and MANBER , U. , 1984 , Optimal sequencing of torch paths in flame cutting , Journal of Manufacturing Systems , 3 , 81 .
- ISRANI , S. , and SANDERS , J. L. , 1982 , Two-dimensional cutting stock problem research A review and a new rectangular layout algorithm , Journal of Manufacturing Systems , 1 , 169 .
- ISRANI , S. , and SANDERS , J. L. , 1983 , manufacturing decision support system for flame cutting . Computers and Industrial Engineering ( to appear ).
- SNEDECOR , G. W. , and COCHRAN , W. G. , Statistical methods ( Ames , Iowa Iowa State University ), pp. 233 – 237 .
- WANG , P. Y. , 1981 , Two algorithms for constrained two-dimensional cutting stock problems . University of Maryland Mathematics Research , 81–3 .