Article ID: | iaor201528996 |
Volume: | 23 |
Issue: | 1-2 |
Start Page Number: | 47 |
End Page Number: | 63 |
Publication Date: | Jan 2016 |
Journal: | International Transactions in Operational Research |
Authors: | Arbib Claudio, Marinelli Fabrizio, Ventura Paolo |
Keywords: | cutting stock, heuristics, production |
We address a one‐dimensional cutting stock problem where, in addition to trim‐loss minimization, cutting patterns must be sequenced so that no more than s different part types are in production at any time. We propose a new integer linear programming formulation whose constraints grow quadratically with the number of distinct part types and whose linear relaxation can be solved by a standard column generation procedure. The formulation allowed us to solve problems with 20 part types for which an optimal solution was unknown.