Title: Two-dimensional cutting stock problem with multiple stock sizes

Authors: Umutcan Ayasandır; Meral Azizoğlu

Addresses: Aselsan Electronics Company, Ankara 06172, Turkey ' Department of Industrial Engineering, Middle East Technical University, Ankara 06800, Turkey

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.

DOI: 10.1504/IJMTM.2024.137486

International Journal of Manufacturing Technology and Management, 2024 Vol.38 No.2, pp.95 - 125

Received: 07 Mar 2021
Accepted: 05 Jul 2021
Published online: 21 Mar 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article