New integer programming formulations and an exact algorithm for the ordered cutting stock problem

Apart from trim loss minimization, there are many other issues concerning cutting processes that arise in real production systems. One of these is related to the number of stacks that need to be opened near the cutting machines. Many researchers have worked in the last years on cutting stock problems with additional constraints on the number of open stacks. In this paper, we address a related problem: the Ordered Cutting Stock Problem (OCSP). In this case, a stack is opened for every new client's order, and it is closed only when all the items of that order are cut. The OSCP has been introduced recently in the literature. Our aim is to provide further insight into this problem. This paper describes three new integer programming formulations for solving it, and an exact algorithm based on column generation, branch-and-bound and cutting planes. We report on computational experiments on a set of random instances. The results show that good lower bounds can be computed quickly, and that optimal solutions can be found in a reasonable amount of time.

[1]  Cliff T. Ragsdale,et al.  The Ordered Cutting Stock Problem , 2004, Decis. Sci..

[2]  Oli B.G. Madsen.  An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry , 1988 .

[3]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[4]  Marcelo Saraiva Limeira.  Pattern reduction in cutting stock problem , 2003 .

[5]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[6]  Horacio Hideki Yanasse.  On a pattern sequencing problem to minimize the maximum number of open stacks , 1997, Eur. J. Oper. Res..

[7]  Jacques Desrosiers,et al.  On Compact Formulations for Integer Programs Solved by Column Generation , 2005, Ann. Oper. Res..

[8]  François Vanderbeck,et al.  Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem , 2000, Oper. Res..

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

[10]  Cláudio Alves,et al.  Cutting and packing : problems, models and exact algorithms , 2005 .

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

[12]  R. W. Haessler.  A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem , 1971 .

[13]  A. A. Farley.  A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..

[14]  Cláudio Alves,et al.  A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem , 2008, Comput. Oper. Res..

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

[16]  Horacio Hideki Yanasse,et al.  Connections between cutting-pattern sequencing, VLSI design, and flexible machines , 2002, Comput. Oper. Res..

[17]  José Carlos Becceneri,et al.  A method for solving the minimization of the maximum number of open stacks problem within a cutting process , 2004, Comput. Oper. Res..

[18]  Chuen-Lung Chen,et al.  A simulated annealing heuristic for the one-dimensional cutting stock problem , 1996 .

[19]  Gleb Belov.  Problems, Models and Algorithms in One- and Two-Dimensional Cutting , 2003 .

[20]  Cláudio Alves,et al.  Accelerating column generation for variable sized bin-packing problems , 2007, Eur. J. Oper. Res..

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

[22]  Stefan Voß,et al.  Applications of modern heuristic search methods to pattern sequencing problems , 1999, Comput. Oper. Res..

[23]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .