MILP formulation for solving the cutting stock problem in the corrugated board boxes industry

RODRIGUEZ, MARIA ANALIA; VECCHIETTI, ALDO

Rio de Janeiro

Simposio; 19th International Symposium on Mathematical Programming; 2006

Federal University of Rio de Janeiro

In this paper the cutting stock problem for the corrugated board boxes industry is presented. Similar problems are found in literature. However, much more complicated scenario is presented in the industry under analysis. Several paper layers are used to form the board, there is a large number of paper types and widths to choose and only orders having same characteristics can be combined. Consequently, problem complexity is very high due to the huge number of products combinations and variables to manage in the cutting process. Reaching a solution by using a MINLP formulation is difficult, because of bilinearities, high combinatory and discrete variables involved. Instead, a MILP strategy has been developed. First, feasible cutting patterns are generated. Then a MILP optimization model selects a subset of them and the length to cut to satisfy problem constraints, minimizing trim loss costs. The approach provides a robust and fast problem solution.