A heuristic for the skiving and cutting stock problem in paper and plastic film industries: skiving and cutting stock
Research output: Contribution to journal › Article › peer-review
This paper investigates the skiving and cutting stock problem (SCSP) encountered in the paper and plastic film industries, in which a set of non-standard reels generated from previous cutting processes are used to produce finished rolls through the skiving and cutting process. First, reels are skived together length-wise to form a reel-pyramid (a polygon) and then, the reel-pyramid is cut into finished rolls of small widths. Depending on if a reel can be divided length-wise into sub-reels to form the reel-pyramid, the problem can be classified into divisible SCSP (DSCSP) and indivisible SCSP (ISCSP). In this paper, two integer programming (IP) models are proposed for DSCSP and ISCSP respectively. A sequential value correction procedure combined with the two IP models (SVCTIP) is developed to solve the two SCSPs. The effectiveness of the SVCTIP is demonstrated though extensive computational tests.
Original language | English |
---|---|
Journal | International Transactions In Operational Research |
Early online date | 9 Feb 2017 |
DOIs | |
Publication status | Early online - 9 Feb 2017 |
Documents
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries
Rights statement: This is the peer reviewed version of the following article: Chen, Y., Song, X., Ouelhadj, D. and Cui, Y. (2017), A heuristic for the skiving and cutting stock problem in paper and plastic film industries. Intl. Trans. in Op. Res., which has been published in final form at doi:10.1111/itor.12390. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.
Accepted author manuscript (Post-print), 1.36 MB, PDF document
Links
Related information
ID: 5248238