Optimasi Panjang Mainroll pada Industri Pulp & Paper untuk Kebutuhan Kertas HVS dengan Integer Programming
DOI:
https://doi.org/10.25170/metris.v25i02.5955Keywords:
Integer Programming, mainroll, pulp & paper, branch & boundAbstract
PT. XYZ is a company engaged in the production of paper and pulp. These are two products are interrelated because to produce paper, raw materials are neededin the form of pulp. And often the paper production in the factory is excessive. This study aims to determine the optimal mainroll length according to demand so that overproduction will be minimized. The approach used is Integer
Programming with the Branch and Bound method, where previously obtained combinations of possible paper arrangements on the mainroll with a maximum length of 80 km and a the width of 8,5 m. based on the optimal calculation results for the December 2022 production period, the mainroll length produced is 139,23 km which produced 14.891 reams for A4 paper, 10.539 reams for F4
paper and 10.239 reams for Q4 paper. The excess production of each type of paper was 0.34 %, 0,02 % dan 1,82 %, respectively. While the total overproduction for all types of paper sizes was 0,67 %. Production results in December 2022, overproduction of A4, F4 and Q4 were 1,15 %, 3,26 % and 2,92 %, respectively. While the total overproduction for all types of paper sizes was 2,28 %. The standart deviation of the calculation of real conditions is 1,13%, meaning that the deviation of excess production in real conditions is greater.
References
Abuhassan, I.A.O, & Nasereddin, H.H.O., 2011, Cutting stock problem: Solution Behaviors, International Journal of Recent Research and Applied Studies (IJRRAS), 6(4), 429-433.
Becceneri, J.C., Hideki, H.H., & Soma, N.Y., 2004, A method for solving the minimization of the maximum number of open stacks problem within a cutting process, Computers & Operations Research, 31(14), 2315-2332.
Filho, A.A., Moretti, A.C., & Vaz Pato, M., 2018, A comparative study of exact methods for the biobjective integer one-dimensional cutting stock problem, Journal of the Operational Research Society, 69(1), 91-107.
Chauhan, S.S, Martel, A., & D'Amour, S., (2008), Roll Assortment Optimization in a Paper Mill: An Integer Programming Approach, Computers & Operations Research, 35(2), 614-627.
Correia, M.H., Oliveira, J.F., & Ferreira, J.S., 2012, Integrated resolution of assignment, sequencing and cutting problems in paper production planning, International Journal of Production Research, 50(18), 5195-5212.
Linhares, A., & Hideki, H., 2002, Connections between cutting-pattern sequencing, VLSI design, and flexible machines, Computers & Operations Research, 29(12), 1759-1772.
Mabasher, A., & Ekichi, A., (2013), Solution approaches for the cutting stock problem with setup cost, Computers & Operations Research, 40(1), 225-235.
Marchand, H., Martin, A., Weismantel, R., &Wosley, L., 2001, Cutting planes in integer and mix integer programming, Discrete Applied Mathematics, 123(1-3), 397-446
Ogunranti, G.A., & Oluleye, A.E., 2016, Minimizing waste (off-cuts) using cutting stock model: The case of one dimensional cutting stock problem in wood working industry, Journal of Industrial Engineering and Management, 9(3), 834-859.
Silva, E., Alvelos, F., & De Carvalho Valerio, J.M., 2010, An integer programming model for two and three-stage two dimensional cutting stock problems, European Journal of Operation Research, 205(3), 699-708
