Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
We propose a two-stage approach for the one-dimensional cutting stock problem. Many patterns are generated in the first stage by a sequential grouping procedure. An integer programming model is solved to select the patterns in the solution. The sequential grouping procedure is efficient for pattern reduction. Solving the integer programming model can significantly reduce the total cost.
one-dimensional cutting cutting cutting stock setup cost pattern reduction