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.
Optimization Models for Cut Sequencing / Arbib, Claudio; Avella, Pasquale; Boccia, Maurizio; Marinelli, Fabrizio; Mattia, Sara. - STAMPA. - 217:(2017), pp. 443-451. [10.1007/978-3-319-67308-0_45]
Optimization Models for Cut Sequencing
Arbib, Claudio;Marinelli, Fabrizio;
2017-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
