A heuristic for the skiving and cutting stock problem in paper and plastic film industries

A heuristic for the skiving and cutting stock problem in paper and plastic film industries Yan Chen , Xiang Song, Djamila Ouelhadj, Yaodong Cui 1 School of Business Administration, South China University of Technology, Guangzhou 510640, China 2 Department of Mathematics, University of Portsmouth, Portsmouth PO1 3HF, United Kingdom 3 School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China Abstract: This paper investigates the skiving and cutting stock problem (SCSP) encountered in the paper and plastic film industries, in which a set of non-standard reels generated from previous cutting processes are used to produce finished rolls through the skiving and cutting process. First, reels are skived together length-wise to form a reelpyramid (a polygon) and then, the reel-pyramid is cut into finished rolls of small widths. Depending on if a reel can be divided length-wise into sub-reels to form the reel-pyramid, the problem can be classified into divisible SCSP (DSCSP) and indivisible SCSP (ISCSP). In this paper, two integer programming (IP) models are proposed for DSCSP and ISCSP respectively. A sequential value correction procedure combined with the two IP models (SVCTIP) is developed to solve the two SCSPs. The effectiveness of the SVCTIP is demonstrated though extensive computational tests.

[1]  Xiang Song,et al.  An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem , 2006, Eur. J. Oper. Res..

[2]  Gleb Belov,et al.  One-dimensional heuristics adapted for two-dimensional rectangular strip packing , 2008, J. Oper. Res. Soc..

[3]  Gautam Appa,et al.  A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem , 2015, J. Oper. Res. Soc..

[4]  Claudio Arbib,et al.  One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model , 2016, Int. Trans. Oper. Res..

[5]  E. J. Zak.  The skiving stock problem as a counterpart of the cutting stock problem , 2003 .

[6]  Yi Yao,et al.  Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost , 2015, Eur. J. Oper. Res..

[7]  Andréa Carla Gonçalves Vianna.  Cutting and packing problems: an AND/OR-Graph approach , 2000 .

[8]  Gleb Belov,et al.  Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting , 2007, INFORMS J. Comput..

[9]  Yaodong Cui,et al.  A heuristic for the one-dimensional cutting stock problem with usable leftover , 2010, Eur. J. Oper. Res..

[10]  Brenda Cheang,et al.  An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem , 2016, Int. Trans. Oper. Res..

[11]  Guntram Scheithauer.  A note on handling residual lengths , 1991 .

[12]  Yaodong Cui,et al.  Pattern-set generation algorithm for the one-dimensional multiple stock sizes cutting stock problem , 2015 .

[13]  Wei Hu,et al.  Heuristic for constrained two-dimensional three-staged patterns , 2015, J. Oper. Res. Soc..

[14]  Alain Martel,et al.  Roll assortment optimization in a paper mill: An integer programming approach , 2008, Comput. Oper. Res..

[15]  Steffen Rebennack,et al.  Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges , 2014, Eur. J. Oper. Res..

[16]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[17]  Yaodong Cui,et al.  Sequential heuristic for the two-dimensional bin-packing problem , 2015, Eur. J. Oper. Res..

[18]  Yi-Ping Cui,et al.  Parallelized sequential value correction procedure for the one-dimensional cutting stock problem with multiple stock lengths , 2014 .

[19]  S.M.A. Suliman,et al.  A SEQUENTIAL HEURISTIC PROCEDURE FOR THE TWO-DIMENSIONAL CUTTING-STOCK PROBLEM , 2006 .

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

[21]  John Martinovic,et al.  Integer linear programming models for the skiving stock problem , 2016, Eur. J. Oper. Res..

[22]  Yuriy Stoyan,et al.  Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization , 2016, J. Oper. Res. Soc..

[23]  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..

[24]  Yan Chen,et al.  New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers , 2017, J. Oper. Res. Soc..

[25]  Michele Garraffa,et al.  The one-dimensional cutting stock problem with sequence-dependent cut losses , 2016, Int. Trans. Oper. Res..

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