A Solution for 2D Rectangular Cutting Stock Problems with 3-Stage Guillotine-Cutting Constraint

[1]  Günther R. Raidl,et al.  Models and algorithms for three-stage two-dimensional bin packing , 2007, Eur. J. Oper. Res..

[2]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[3]  John E. Beasley,et al.  Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .

[4]  François Vanderbeck,et al.  A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem , 2001, Manag. Sci..

[5]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[6]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[7]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[8]  Graham Kendall,et al.  A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..

[9]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[10]  Daniele Vigo,et al.  An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..

[11]  N. Ono,et al.  An evolutionary approach to two-dimensional guillotine cutting problem , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[12]  E. Hopper,et al.  A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.

[13]  Mhand Hifi,et al.  An efficient approach for large-scale two-dimensional guillotine cutting stock problems , 1998, J. Oper. Res. Soc..