New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers

Cui, Yaodong; Song, Xiang; Chen, Yan; Cui, Yi-Ping

doi:10.1057/s41274-016-0098-y

Cited by 23 publications

(18 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the CSP with usable leftovers has been addressed in the literature (Scheithauer, ; Cui and Yang, ; Cui et al., ), the approaches assume that leftovers generated in previous cutting processes cannot be assembled into a large object that can be used to produce items.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Chen

Song

Ouelhadj

et al. 2017

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

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

Chen

Song

Ouelhadj

et al. 2017

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several studies address the use of optimization models applied to the cutting problem [3][4][5][6][7][8][9][10][11][12]. In this context, this paper aims to apply and test a one-dimensional bar cutting optimization model in a company of the aluminum frame segment using three objective functions, in order to reduce the leftovers from the bar cutting, as well as the number of bars used for the door production process.…”

Section: Introductionmentioning

confidence: 99%

Aluminum bar cutting optimization for door and window manufacturing

Machado

Zayatz

Silva

et al. 2020

DYNA

View full text Add to dashboard Cite

This study aims to optimize the one-dimensional cutting process of aluminum bars for the production of aluminum doors. Reducing the use of bars and the amount of material that becomes scrap is a key factor in process efficiency, reducing the need for raw material procurement. The mathematical model used considers the size of the bar, the number and size of cuts, the size of the leftovers that can be used and the size of the leftovers that are considered scrap. Based on real data from a company in the aluminum frame segment, the mathematical model was used to simulate three different scenarios. Three different objective functions were used in the simulations, and the results obtained in each scenario were described in order to indicate the advantages and disadvantages of using each objective function. For the instance sizes studied, the model is able to obtain optimal solutions with little computational time.

show abstract

“…Besides modeling in linear programming, many researchers also solved those problems heuristically. Cui et al [4] developed a new model and proposed a two-phase heuristics algorithm to solve the cutting problem with usable leftovers. Tanir et al [5], proposed heuristic dynamic programming to solve the cutting stock problem in steel industries.…”

Section: Introductionmentioning

confidence: 99%

Solving a Real Problem in Plastic Industry: A Case in Trim-loss Problem

Renata

Halim

Yahya

2020

KLS

View full text Add to dashboard Cite

In this paper, a cutting plane model is presented for solving a problem in a cast polypropylene (CPP) plastic film manufacturer. The company produces plastic rolls from plastic pellets with widths ranging from 3 050 mm to 3 250 mm. The plastic rolls are trimmed according to customer’s orders. In prior to the trimming process, the production planning and inventory control (PPIC) department scheduled the machines and arranged the plastic trim compositions manually. In this work, the plastic trimming problem is solved by applying the trim loss model. Since trimmed loss problem is an NP-hard problem. In this case, the permutations are selected in advance so that the total length is feasible to the machine length. The computation is carried out using visual basic for application (VBA). The model outcomes are then used for optimizing the machine scheduling process. Modified earliest due date is proposed to schedule in which machines customer’s orders should be done. The machines scheduling represents the company conditions and the cutting production can be scheduled for daily basis. Keywords: cutting plane; cutting stock; earliest due date; machine scheduling; non-polinomial-hard problem.

show abstract

New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers

Cited by 23 publications

References 21 publications

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

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

Aluminum bar cutting optimization for door and window manufacturing

Solving a Real Problem in Plastic Industry: A Case in Trim-loss Problem

Contact Info

Product

Resources

About