Minimization of Trim Loss Problem in Paper Mill Scheduling Using MINLP

MINLP를 이용한 제지 공정의 파지 손실 최소화

This study performs optimization of paper mill scheduling using MINLP(Mixed-Integer Non-Linear Programming) method and 2-step decomposing strategy. Paper mill process is normally composed of five units: paper machine, coater, rewinder, sheet cutter and roll wrapper/ream wrapper. Various kinds of papers are produced through these units. The bottleneck of this process is how to cut product papers efficiently from raw paper reel and this is called trim loss problem or cutting stock problem. As the trim must be burned or recycled through energy consumption, minimizing quantity of the trim is important. To minimize it, the trim loss problem is mathematically formulated in MINLP form of minimizing cutting patterns and trim as well as satisfying customer's elder. The MINLP form of the problem includes bilinearity causing non-linearity and non-convexity. Bilinearity is eliminated by parameterization of one variable and the MINLP form is decomposed to MILP(Mixed-Integer Linear programming) form. And the MILP problem is optimized by means of the optimization package. Thus trim loss problem is efficiently minimized by this 2-step optimization method.