One‐dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. (24th November 2014)

• Record Type: Journal Article
• Authors: Arbib, Claudio; Marinelli, Fabrizio; Ventura, Paolo
• Is Part Of: International transactions in operational research. Volume 23:Number 1/2(2016:Jan./Mar.)
• Page Start: 47
• Page End: 63
• Publication Date: 2014-11-24
• Subjects: cutting stock -- open stacks -- pattern sequencing -- integer linear programming; Operations research -- Periodicals; 003
• DOI: 10.1111/itor.12134
• Languages: English
• ISSNs: 0969-6016

Abstract

Abstract: 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.