Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry

• Published in: International journal of production research Vol. 52; no. 19; pp. 5675 - 5689
• Main Authors: Kim, Kyungdoc, Kim, Byung-In, Cho, Hyunbo
• Format: Journal Article
• Language: English
• Published: London Taylor & Francis 01.01.2014; Taylor & Francis LLC
• Subjects: Algorithms; Computational efficiency; Cutting; Cutting stock problem; Heuristic; Heuristic methods; knapsack algorithm; Knapsack problem; Mathematical models; multiple-choice knapsack problem; paper mill industry; Paper mills; Pulp & paper industry; Raw materials; Rolls; Studies; Two dimensional; two-stage cutting stock problem; South Korea
• ISSN: 0020-7543; 1366-588X
• DOI: 10.1080/00207543.2014.903347

This study examines a two-stage two-dimensional cutting stock problem encountered by a paper mill company. The problem includes various machine-related and operational constraints based on real-world situations. Paper products are manufactured using two major cutting processes. Each cutting machine has a specific minimum and maximum width for input and output rolls and is limited by the maximum number of rolls it can cut at the same time. A mathematical model is presented to formally address the problem and an efficient multiple-choice knapsack-based heuristic algorithm is proposed to solve the problem. To demonstrate the efficiency of the proposed heuristic algorithm, computational experiments are conducted on test data-set generated from real-world data provided by a large paper mill company in the Republic of Korea.