Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation

Aphisak Witthayapraphakorn, Sasarose Jaijit and Peerayuth Charnsethikul

International Journal of Mathematics in Operational Research, 2021, vol. 18, issue 3, 360-383

Abstract: This study shows the integration of Benders' decomposition, column generation, and a special-purpose algorithm for solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands. The results show that there is a linear relationship between the processing time and the number of scenarios involved in the raw material cutting patterns. Moreover, the algorithm results are not different from using column generation. During the search for production patterns, the quality of the solutions relies on the convergence tolerance. As the tolerance approaches zero, the solutions become near-optimal, but the computational time increases substantially. In addition, the experimental results indicate that the proposed method is suitable for large-scale problems.

Keywords: stochastic linear programming; one-dimensional cutting stock problem; uncertain demands; large-scale linear programming; Benders' decomposition. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=113578 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:18:y:2021:i:3:p:360-383

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().