A Global Method for a Two-Dimensional Cutting Stock Problem in the Manufacturing Industry

[1]  Daniele Vigo,et al.  Recent advances on two-dimensional bin packing problems , 2002, Discret. Appl. Math..

[2]  Chang-Chun Lin,et al.  A genetic algorithm for solving the two-dimensional assortment problem , 2006, Comput. Ind. Eng..

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

[4]  S. Jakobs,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 2022 .

[5]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

[6]  Marco A. Boschetti,et al.  The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case , 2003, 4OR.

[7]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[8]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[9]  Ming-Hua Lin,et al.  An efficient deterministic optimization approach for rectangular packing problems , 2013 .

[10]  Daniele Vigo,et al.  A lower bound for the non-oriented two-dimensional bin packing problem , 2002, Discret. Appl. Math..

[11]  Jung-Fa Tsai,et al.  An optimization algorithm for cutting stock problems in the TFT-LCD industry , 2009, Comput. Ind. Eng..

[12]  M. P. Reinders,et al.  Cutting stock optimization and integral production planning for centralized wood processing , 1992 .

[13]  Paolo Toth,et al.  A Set-Covering-Based Heuristic Approach for Bin-Packing Problems , 2006, INFORMS J. Comput..

[14]  E. M. L. Beale,et al.  Global optimization using special ordered sets , 1976, Math. Program..

[15]  Bernard Chazelle,et al.  The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation , 1983, IEEE Transactions on Computers.

[16]  Han-Lin Li,et al.  An approximately global optimization method for assortment problems , 1998, Eur. J. Oper. Res..

[17]  Zhou-Jing Wang,et al.  A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach , 2008, Eur. J. Oper. Res..

[18]  José Fernando Oliveira,et al.  Reel and sheet cutting at a paper mill , 2004, Comput. Oper. Res..

[19]  A. I. Hinxman.  The trim-loss and assortment problems: A survey , 1980 .

[20]  Shu-Cherng Fang,et al.  A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems , 2013, INFORMS J. Comput..

[21]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2011, Math. Program..

[22]  Marvin D. Troutt,et al.  Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem , 2003, Eur. J. Oper. Res..

[23]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[24]  Hao-Chun Lu,et al.  An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry , 2013, Comput. Ind. Eng..

[25]  Sung Kyu Lim,et al.  Physical design for 3D system on package , 2005, IEEE Design & Test of Computers.

[26]  Han-Lin Li,et al.  Approximately global optimization for assortment problems using piecewise linearization techniques , 2002, Eur. J. Oper. Res..

[27]  J.-F. Tsai,et al.  A distributed global optimization method for packing problems , 2003, J. Oper. Res. Soc..

[28]  S. Martello,et al.  Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .

[29]  David Pisinger,et al.  The two-dimensional bin packing problem with variable bin sizes and costs , 2005, Discret. Optim..

[30]  J. O. Berkey,et al.  Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[32]  Sanjiv Sarin,et al.  A mixed-integer programming model for a class of assortment problems , 1993 .

[33]  Chin-Sheng Chen,et al.  An analytical model for the container loading problem , 1995 .

[34]  E. Hopper,et al.  A genetic algorithm for a 2D industrial packing problem , 1999 .

[35]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[36]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

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

[38]  Marco A. Boschetti,et al.  The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds , 2003, 4OR.

[39]  Daniele Vigo,et al.  Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems , 1999, INFORMS J. Comput..