Two-dimensional cutting stock problem with multiple stock sizes

Umutcan Ayasandır and Meral Azizoğlu

International Journal of Manufacturing Technology and Management, 2024, vol. 38, issue 2, 95-125

Abstract: In this study, we consider a two-dimensional cutting stock problem with multiple stock sizes and two-stage guillotine cuts. Our objective is to maximise the difference between total revenue earned over all cut items and total cost spent over all used panels. We propose two mathematical models, derive some optimality properties and use them to enhance the performances of the models. We develop decomposition-based heuristics that use the best of the proposed models to solve the subproblems. The results of our computational study have revealed that the models can return optimal solutions for the instances with up to 30 items in two hours and the heuristics produce near-optimal solutions for the instances with up to 50 items in five minutes.

Keywords: integer programming; heuristics; cutting stock problem. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=137486 (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:ijmtma:v:38:y:2024:i:2:p:95-125

Access Statistics for this article

More articles in International Journal of Manufacturing Technology and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().