One-dimensional cutting stock with a limited number of open stacks : bounds and solutions from a new integer linear programming model
Year of publication: |
January/March 2016
|
---|---|
Authors: | Arbib, Claudio ; Marinelli, Fabrizio ; Ventura, Paolo |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 23.2016, 1/2, p. 47-63
|
Subject: | cutting stock | open stacks | pattern sequencing | integer linear programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Packproblem | Packing problem |
-
Martin, Mateus, (2023)
-
The one-dimensional cutting stock problem with sequence-dependent cut losses
Garraffa, Michele, (2016)
-
Integrated optimisation on flow-shop production with cutting stock
Wang, Weihao, (2019)
- More ...
-
An improved integer linear programming formulation for the closest 0-1 string problem
Arbib, Claudio, (2017)
-
An LP-based tabu search for batch scheduling in a cutting process with finite buffers
Arbib, Claudio, (2012)
-
Arbib, Claudio, (2005)
- More ...