2014
DOI: 10.1111/itor.12134
|View full text |Cite
|
Sign up to set email alerts
|

One‐dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model

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 soluti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0
5

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 35 publications
(19 citation statements)
references
References 13 publications
0
13
0
5
Order By: Relevance
“…In literature, various types of cutting stock problems have been investigated [7][8][9][10]. Effective algorithms for solving cutting stock problems are beneficial to reduce production cost and improve material utilization [11].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In literature, various types of cutting stock problems have been investigated [7][8][9][10]. Effective algorithms for solving cutting stock problems are beneficial to reduce production cost and improve material utilization [11].…”
Section: Literature Reviewmentioning
confidence: 99%
“…A more compact formulation, where the number of constraints increases polynomially with n, was then proposed by [9]. The formulation is based on the idea of feasible track, a 0-1 matrix B with n rows that has the Consecutive Ones Property (C1P) and exactly θ max 1's per column.…”
Section: The Stack-constrained Cspmentioning
confidence: 99%
“…Posteriormente, se genera un subproblema el cual permite identificar columnas o variables adicionales que no han sido incluidas en el programa maestro y que mejoran el valor de la función objetivo. En los problemas unidimensionales este es el equivalente a resolver el problema de la "mochila" unidimensional [32], trabajos similares son presentados en [34].…”
Section: Programación Lineal Enteraunclassified