Sequence selection of stock sheets in two-dimensional layout problems

References

• ADAMOWICZ , M. , and ALBANO , A. , 1976 , A solution of the rectangular cutting stock problem . IEEE Transactions on Systems, Man, and Cybernetics , SMC-6 , 302 .
   Web of Science ®Google Scholar
• BEASLEY , J. E. , 1985 a , An algorithm for the two-dimensional assortment problem . European Journal of Operational Research , 119 , 253 .
   Google Scholar
• BEASLEY , J. E. , 1985 b , An exact two-dimensional non-guillotine cutting tree search procedure . Operations Research , 133 , 49 .
   Google Scholar
• BENGTSSON , B. , 1982 , Packing rectangular pieces—a heuristic approach . The Computer Journal 25 , 353 .
   Web of Science ®Google Scholar
• CHAMBERS , M. L. , and DYSON , R. G. , 1976 , The cutting stock problem in the flat glass industry—selection of stock sizes . Operational Research Quarterly , 27 , 949 .
   Google Scholar
• CHRISTOFIDES , N. , and WHITLOCK , C. , 1977 , An algorithm for two-dimensional cutting problems . Operations Research , 25 , 30 .
   Web of Science ®Google Scholar
• DAĞLI , C. H. ,TATO6 LU , M. Y. , 1987 , An approach to two-dimensional cutting stock problems . International Journal of Production Research , 25 , 175 .
   Web of Science ®Google Scholar
• DECANI , P. , 1978 , A note on two-dimensional rectangular cutting problems . Journal of the Operational Research Society , 29 , 703 .
   Google Scholar
• DYCKHOFF , H. , 1981 , A new linear programming approach to the cutting stock problem . Operations Research , 29 , 1092 .
   Web of Science ®Google Scholar
• GAREY , M. R. , and JOHNSON , D. S. , 1979 , Computers and Intractability A Guide to the Theory of NP-Completeness ( San Francisco Freeman ).
   Google Scholar
• GILMORE , P. C , and GOMORY , R. E. , 1961 , A linear programming approach to the cutting stock problem . Operations Research , 9 , 849 .
   Web of Science ®Google Scholar
• GILMORE , P. C. , and GOMORY , R. E. , 1965 , Multistage cutting stock problems of two and more dimensions . Operations Research , 13 , 94 .
   Web of Science ®Google Scholar
• HODGSON , T. J. , 1982 , A combined approach to the pallet loading problem . IIE Transactions , 14 , 175 .
   Web of Science ®Google Scholar
• HOROWITZ , E. , and SAHNI , S. , 1976 , Fundamentals of Data Structures ( Rockville , Maryland Computer Science Press ).
   Google Scholar
• 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 , 11 , 169 .
   Google Scholar
• ISRANI , S. , and SANDERS , J. L. , 1985 , Performance testing of rectangular partsnesting heuristics . International Journal of Production Research , 23 , 437 .
   Web of Science ®Google Scholar
• Metal Statistics 1984 ( New York Fairchild Publications ).
   Google Scholar
• QU , W. , and SANDERS , J. L. , 1987 , A nesting algorithm for irregular parts and factors affecting trim losses . International Journal of Production Research , 25 , 381 .
   Web of Science ®Google Scholar
• STEUDEL , H. J. , 1979 , Generating pallet loading patterns a special case of the two-dimensional cutting stock problem . Management Science , 25 , 997 .
   Web of Science ®Google Scholar
• THESEN , A. , 1975 , A recursive branch and bound algorithm for the multi-dimensional knapsack problem . Naval Research Logistics Quarterly , 22 , 341 .
   Google Scholar
• TOKUYAMA , H. , and UENO , N. , 1985 , The cutting stock problem for large sections in the iron and steel industries . European Journal of Operational Research , 22 , 280 .
   Web of Science ®Google Scholar