Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry
SCIE
SCOPUS
- Title
- Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry
- Authors
- Kim, K; Kim, BI; Cho, H
- Date Issued
- 2014-01
- Publisher
- TAYLOR & FRANCIS LTD
- Abstract
- 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.
- Keywords
- two-stage cutting stock problem; cutting stock problem; multiple-choice knapsack problem; knapsack algorithm; paper mill industry; LINEAR-PROGRAMMING APPROACH; LP-BASED APPROACH; PACKING; MODELS; MILL
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/13916
- DOI
- 10.1080/00207543.2014.903347
- ISSN
- 0020-7543
- Article Type
- Article
- Citation
- INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol. 52, no. 19, page. 5675 - 5689, 2014-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.