A heuristic for the skiving and cutting stock problem in paper and plastic film industries. (9th February 2017)

• Record Type: Journal Article
• Authors: Chen, Yan; Song, Xiang; Ouelhadj, Djamila; Cui, Yaodong
• Is Part Of: International transactions in operational research. Volume 26:Number 1(2019)
• Page Start: 157
• Page End: 179
• Publication Date: 2017-02-09
• Subjects: combinatorial optimization -- skiving and cutting stock -- reel cutting -- cutting problems; Operations research -- Periodicals; 003
• DOI: 10.1111/itor.12390
• Languages: English
• ISSNs: 0969-6016

Abstract

Abstract: This paper investigates the skiving and cutting stock problem (SCSP) encountered in the paper and plastic film industries, in which a set of nonstandard reels generated from previous cutting processes are used to produce finished rolls through the skiving and cutting process. First, reels are skived together lengthwise 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 lengthwise into subreels 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 through extensive computational tests.