Back to Search
Start Over
Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry.
- Source :
- International Journal of Production Research; Oct2014, Vol. 52 Issue 19, p5675-5689, 15p, 5 Diagrams, 9 Charts
- Publication Year :
- 2014
-
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. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00207543
- Volume :
- 52
- Issue :
- 19
- Database :
- Complementary Index
- Journal :
- International Journal of Production Research
- Publication Type :
- Academic Journal
- Accession number :
- 97655598
- Full Text :
- https://doi.org/10.1080/00207543.2014.903347