2021
DOI: 10.1007/s00291-021-00647-8
|View full text |Cite
|
Sign up to set email alerts
|

A Bi-Integrated Model for coupling lot-sizing and cutting-stock problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 33 publications
0
1
0
Order By: Relevance
“…Cerqueira [6] proposed a change in the constructive greedy heuristic that consists of building a cutting pattern by sorting in descending order the items of pair or odd length, with priority being given to those which appear more frequently. Ayres [7] introduced a new model for integrated lot sizing, onedimensional cutting stock, and two-dimensional cutting stock problems, using a column generation heuristic algorithm and applying a relax-and-fix technique to evaluate the proposed model from a series of experiments. Wang [8] addressed an integrated scheduling optimization of flow-shop production with a one-dimensional cutting stock in make-toorder environments and developed a hybrid algorithm by integrating a local search method and some efficient strategies under the nested partitions framework.…”
Section: Introductionmentioning
confidence: 99%
“…Cerqueira [6] proposed a change in the constructive greedy heuristic that consists of building a cutting pattern by sorting in descending order the items of pair or odd length, with priority being given to those which appear more frequently. Ayres [7] introduced a new model for integrated lot sizing, onedimensional cutting stock, and two-dimensional cutting stock problems, using a column generation heuristic algorithm and applying a relax-and-fix technique to evaluate the proposed model from a series of experiments. Wang [8] addressed an integrated scheduling optimization of flow-shop production with a one-dimensional cutting stock in make-toorder environments and developed a hybrid algorithm by integrating a local search method and some efficient strategies under the nested partitions framework.…”
Section: Introductionmentioning
confidence: 99%