Skip to content
Back to outputs

A heuristic for the skiving and cutting stock problem in paper and plastic film industries: skiving and cutting stock

Research output: Contribution to journalArticlepeer-review

Standard

A heuristic for the skiving and cutting stock problem in paper and plastic film industries : skiving and cutting stock. / Yan, Chen; Song, Xiang; Ouelhadj, Djamila; Cui, Yaodong.

In: International Transactions in Operational Research, 09.02.2017.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Author

Bibtex

@article{3420fb585558403e93677f2854da54b9,
title = "A heuristic for the skiving and cutting stock problem in paper and plastic film industries: skiving and cutting stock",
abstract = "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.",
keywords = "Skiving and cutting stock , Cutting problems, Reel cutting, Combinatorial optimization, embargoover12",
author = "Chen Yan and Xiang Song and Djamila Ouelhadj and Yaodong Cui",
year = "2017",
month = feb,
day = "9",
doi = "10.1111/itor.12390",
language = "English",
journal = "International Transactions in Operational Research",
issn = "0969-6016",
publisher = "Wiley",

}

RIS

TY - JOUR

T1 - A heuristic for the skiving and cutting stock problem in paper and plastic film industries

T2 - skiving and cutting stock

AU - Yan, Chen

AU - Song, Xiang

AU - Ouelhadj, Djamila

AU - Cui, Yaodong

PY - 2017/2/9

Y1 - 2017/2/9

N2 - 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.

AB - 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.

KW - Skiving and cutting stock

KW - Cutting problems

KW - Reel cutting

KW - Combinatorial optimization

KW - embargoover12

U2 - 10.1111/itor.12390

DO - 10.1111/itor.12390

M3 - Article

JO - International Transactions in Operational Research

JF - International Transactions in Operational Research

SN - 0969-6016

ER -

ID: 5248238