Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation Online publication date: Fri, 12-Mar-2021
by Aphisak Witthayapraphakorn; Sasarose Jaijit; Peerayuth Charnsethikul
International Journal of Mathematics in Operational Research (IJMOR), Vol. 18, No. 3, 2021
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook