Optimization Online


Cutting Stock with Bounded Open Stacks: a New Integer Linear Programming Model

Claudio Arbib(claudio.arbib***at***univaq.it)
Fabrizio Marinelli(marinelli***at***diiga.univpm.it)
Paolo Ventura(paolo.ventura***at***iasi.cnr.it)

Abstract: We address a 1-dimensional cutting stock problem where, in addition to trim-loss minimization, we require that the set of cutting patterns forming the solution can be sequenced so that the number of stacks of parts maintained open throughout the process never exceeds a given $s$. For this problem, we propose a new integer linear programming formulation whose constraints grow quadratically with the number of distinct part types.

Keywords: production problem, mixed integer linear programming

Category 1: Applications -- OR and Management Sciences (Production and Logistics )

Category 2: Integer Programming ((Mixed) Integer Linear Programming )

Citation: Tech. Rep. TRCS 007/2010, Dip. di Informatica, UniversitÓ degli Studi dell'Aquila

Download: [PDF]

Entry Submitted: 07/06/2010
Entry Accepted: 07/06/2010
Entry Last Modified: 07/06/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society