References

• Baker , B. , Coffman Jr. , E. G. and Rivest , R. 1980 . “Orthogonal packings in two dimensions” . SIAM Journal on Computing , 9 : 846 – 855 .
   Web of Science ®Google Scholar
• Bartholdi , J. III , J. , Vate and J. , Zhang . 1989 . “Expected performance of the shelf heuristic for 2D packing” . Operations Research Letter , 8 : 11 – 16 .
   Web of Science ®Google Scholar
• Beasley , J. E. 1984 . “An algorithm for the two-dimensional assortment problem” . In Department of Management Science , London : Imperial College .
   Google Scholar
• Beasley , J. E. 1985 . “An exact two-dimensional non-guillotine cutting tree search procedure” . Operations Research , 33 : 49 – 64 .
   Web of Science ®Google Scholar
• Beasley , J. E. 1985 . “Algorithms for unconstrained two dimensional guillotine cutting” . Journal of the Operational Research Society , 36 : 297 – 306 .
   Web of Science ®Google Scholar
• Biro , M. and Boros , E. 1984 . “Network flows and non-guillotine cutting patterns” . European Journal of Operational Research , 16 : 215 – 221 .
   Web of Science ®Google Scholar
• Brown , D. J. 1980 . “An improved bl lower bound” . Information Processing Letters , 11 : 37 – 39 .
   Web of Science ®Google Scholar
• Chauny , F. , Loulou , R. , Sadones , R and Soumis , F. 1991 . “A two phase heuristic for the two-dimensional cutting stock problem” . Journal of Operational Research Society , 42 : 39 – 47 .
   Web of Science ®Google Scholar
• Chazelle , B. 1983 . “The bottom-left bin-packing heuristic: an efficient implementation” . IEEE Transactions on Computers , C-32 : 697 – 707 .
   Web of Science ®Google Scholar
• Chen , C. S. , Sarin , S. and Ram , E. 1991 . “The pallet packing for non-uniform box sizes” . International Journal of Production Research , 29 : 1963 – 1968 .
   Web of Science ®Google Scholar
• Christofides , N. and Whitlock , C. 1977 . “An algorithm for two dimensional cutting problems” . Operations Research , 25 : 30 – 44 .
   Web of Science ®Google Scholar
• Coffman , E. G. , Garey , H. R. and Johnson , D. S. 1984 . “Approximation algorithms for bin packing — an updated survey” . In Algorithm Design for Computer Systems Design , Edited by: Ausiello , G. , Lucertini , N. and Serafini , P. 49 – 106 . Vienna : Springer .
   Google Scholar
• Dagli , C. H. and Tatoglu , M. Y. 1987 . “An approach to two dimensional cutting stock problems” . International Journal of Production Research , 25 : 175 – 190 .
   Web of Science ®Google Scholar
• De Cani , P. 1978 . “A note on the two-dimensional rectangular cutting-stock problem” . Journal of the Operational Research Society , 41 : 141 – 150 .
   Google Scholar
• Dowsland , K. A. 1987 . “An exact algorithm for the pallet loading problem” . European Journal of Operational Research , 31 : 78 – 84 .
   Web of Science ®Google Scholar
• Dowsland , K. A. and Dowsland , W. 1992 . “Picking Problems” . European Journal of Operational Research , 56 : 2 – 14 .
   Web of Science ®Google Scholar
• El-Bouri , A. , Popplewell , N. , Balakrishman , S. and Alfa , A. S. 1994 . “A search-based heurist is for the two-dimensional bin-packing problem” . INFOR , 32 : 265 – 274 .
   Web of Science ®Google Scholar
• Eilon , S. and Christofides , N. 1971 . “The loading problem” . Management Science , 17 : 259 – 268 .
   Web of Science ®Google Scholar
• Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP Completenes , San Francisco : W. H. Freeman and Company .
   Google Scholar
• Gilmore , P. C. and Gomory , R. E. 1961 . “A linear programming approach to the cutting stock problem (Part 1)” . Operations Research , 9 : 849 – 855 .
   Web of Science ®Google Scholar
• Gilmore , P. C. and Gomory , R. E. 1963 . “A linear programming approach to the cutting stock problem (Part 2)” . Operations Research , 11 : 863 – 888 .
   Web of Science ®Google Scholar
• Gilmore , P. C. and Gomory , R. E. 1965 . “Multistage cutting problems of two and more dimensions” . Operations Research , 13 : 94 – 120 .
   Web of Science ®Google Scholar
• Gilmore , P. C. and Gomory , R. E. 1966 . “The theory and computation of knapsack functions” . Operations Research , 14 : 1045 – 1074 .
   Web of Science ®Google Scholar
• Goulimis , C. 1990 . “Optimal solutions for the cutting stock — problem” . European Journal of Operational Research , 44 : 197 – 208 .
   Web of Science ®Google Scholar
• Hifi , M. 1997 . “The DFI/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems” . European Journal of Operational Research , 97 : 41 – 52 .
   Web of Science ®Google Scholar
• Israni , S.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 – 182 .
   Google Scholar
• Israni , S. S. and Sanders , J. L. 1985 . “Performance testing of rectangular parts-nesting heuristics” . International Journal of Production Research , 23 : 437 – 456 .
   Web of Science ®Google Scholar
• Jacobs , S. 1996 . “On genetic algorithm for the packing of polygons” . European Journal of Operational Research , 88 : 165 – 181 .
   Web of Science ®Google Scholar
• Morabito , R. N. and Arenales, M. N. 1992 . “An and-orgraph approach for two-dimensional cutting stock, problems” . European Journal of Operational Research , 58 : 263 – 271 .
   Web of Science ®Google Scholar
• Rode , M. and Rosenberg , O. 1987 . “An analysis of heuristic trimloss algorithm” . Engineering Costs and Production Economy , 12 : 71 – 78 .
   Google Scholar
• Viswanathan , K. V. and Bagchi , A. 1993 . “Best-first search methods for constrained two-dimensional cutting stock — problems” . Operations Research , 41 : 768 – 776 .
   Web of Science ®Google Scholar