2006
DOI: 10.1016/j.ejor.2004.10.034
|View full text |Cite
|
Sign up to set email alerts
|

An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
5
0
1

Year Published

2008
2008
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(7 citation statements)
references
References 34 publications
1
5
0
1
Order By: Relevance
“…This is similar in many aspects to other recent heuristic approaches, like SVC proposed by Belov and Scheithauer (2007) for the classic 1D-CSP, and the sequential heuristic proposed in Song et al (2006) for a variant termed 1.5-dimensional cutting stock problem. For the purpose of comparing SHRP with other approaches of the literature, we have applied it to the classic 1D-CSP and compare with SVC on the benchmark problems proposed in Belov and Scheithauer (2007).…”
Section: Final Remarkssupporting
confidence: 49%
“…This is similar in many aspects to other recent heuristic approaches, like SVC proposed by Belov and Scheithauer (2007) for the classic 1D-CSP, and the sequential heuristic proposed in Song et al (2006) for a variant termed 1.5-dimensional cutting stock problem. For the purpose of comparing SHRP with other approaches of the literature, we have applied it to the classic 1D-CSP and compare with SVC on the benchmark problems proposed in Belov and Scheithauer (2007).…”
Section: Final Remarkssupporting
confidence: 49%
“…Many proposals appear in the literature considering the single-objective formulation of the SPP, but only a few deal with real-world multi-objective constraints [3], [4], [27]. In [27] several secondary optimization criteria are analyzed.…”
Section: Single-objective Approachesmentioning
confidence: 99%
“…In [27] several secondary optimization criteria are analyzed. The multi-objective formulation of the 2DSPP involving the minimization of the strip length and the number of cuts is tackled in [3], [4], [5].…”
Section: Single-objective Approachesmentioning
confidence: 99%
“…SVC procedures have been widely used in the literature to solve cutting and packing problems (Song et al., ; Belov et al., ; Cui et al., ). We propose an SVC procedure and combine it with the DSCSP model to solve the DSCSP.…”
Section: Dscsp Optimization Model and Solution Methodsmentioning
confidence: 99%