Optimization Models for Cut Sequencing

The paper describes models for scheduling the patterns that form a solution of a cutting stock problem. We highlight the problem of providing the required final products with the necessary items obtained from the cut, choosing which pattern feeds which lot of parts. This problem can be solved prior to schedule cuts, or in an integrated way. We present integer programming models for both approaches.