One-dimensional cutting stock optimization in consecutive time periods

The paper deals with the general one-dimensional cutting stock problem (G1D-CSP), where optimization is not limited to a single order. Stock cutting is treated as a permanent business process in a company in which consecutive order sets need to be fulfilled either for production needs or for its customers. Exact demand for future orders is not known in advance. The unutilized and partly utilized stock lengths left after fulfilling current order sets are stored and used later. The goal is the reduction of trim loss and costs over a broader time-span. A new approach is suggested where previously developed method for G1D-CSP is modified. Several practical examples of the cutting process for several consecutive order sets are presented. An extension to a currently used typology for cutting stock problems is proposed.

[1]  Xin Yao,et al.  A new evolutionary approach to cutting stock problems with and without contiguity , 2002, Comput. Oper. Res..

[2]  Miro Gradisar,et al.  Optimization of roll cutting in clothing industry , 1997, Comput. Oper. Res..

[3]  Horacio Hideki Yanasse,et al.  A hybrid heuristic to reduce the number of different patterns in cutting stock problems , 2006, Comput. Oper. Res..

[4]  Claudio Arbib,et al.  Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application , 2005, Eur. J. Oper. Res..

[5]  Miro Gradisar,et al.  Evaluation of algorithms for one-dimensional cutting , 2002, Comput. Oper. Res..

[6]  Miro Gradisar,et al.  A sequential heuristic procedure for one-dimensional cutting , 1999, Eur. J. Oper. Res..

[7]  P. Venkateswarlu The trim-loss problem in a wooden container manufacturing company , 2001 .

[8]  Peter Trkman,et al.  A Comparison Between Exact and Approximate Method for Solution of General One-Dimensional Cutting Stock Problem , 2003, Informatica.

[9]  Gleb Belov,et al.  A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..

[10]  Oliver Holthaus,et al.  On the best number of different standard lengths to stock for one-dimensional assortment problems , 2003 .

[11]  Oliver Holthaus,et al.  Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths , 2002, Eur. J. Oper. Res..

[12]  Peter Trkman,et al.  Information Transfer in Supply Chain Management , 2005 .

[13]  Iiro Harjunkoski,et al.  Solving a production optimization problem in a paper-converting mill with MILP , 1998 .

[14]  Gleb Belov,et al.  A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..

[15]  Claudio Arbib,et al.  Cutting and Reuse: An Application from Automobile Component Manufacturing , 2002, Oper. Res..

[16]  F. Sassani,et al.  Online cutting stock optimization with prioritized orders , 2005 .

[17]  Robert E. Johnston,et al.  A new model for complete solutions to one-dimensional cutting stock problems , 2004, Eur. J. Oper. Res..

[18]  Peter Trkman,et al.  A combined approach to the solution to the general one-dimensional cutting stock problem , 2005, Comput. Oper. Res..

[19]  M. P. Johnson,et al.  Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry , 1997, SIAM Rev..

[20]  Toshihide Ibaraki,et al.  One-dimensional cutting stock problem to minimize the number of different patterns , 2003, Eur. J. Oper. Res..

[21]  Matthias Holweg,et al.  Supply chain simulation - a tool for education, enhancement and endeavour , 2002 .

[22]  Miro Gradisar,et al.  A hybrid approach for optimization of one-dimensional cutting , 1999, Eur. J. Oper. Res..

[23]  Eugene J. Zak Row and column generation technique for a multistage cutting stock problem , 2002, Comput. Oper. Res..

[24]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[25]  Peter Trkman,et al.  Optimization of the Cutting Stock Process , 2003 .

[26]  Michael C. Georgiadis,et al.  An algorithm for the determination of optimal cutting patterns , 2002, Comput. Oper. Res..

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

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

[29]  Janko Cernetic,et al.  Improving competitiveness in veneers production by a simple-to-use DSS , 2004, Eur. J. Oper. Res..