Open AccessSet Covering Model in Solving Multiple Cutting Stock Problem
Author(s) -
Sisca Octarina,
Devi Gusmalia Juita,
Ning Eliyati,
Putra Bahtera Jaya Bangun
Publication year - 2020
Publication title -
science and technology indonesia
Language(s) - English
Resource type - Journals
eISSN - 2580-4391
pISSN - 2580-4405
DOI - 10.26554/sti.2020.5.4.121-130
Subject(s) - stock (firearms) , mathematics , set (abstract data type) , cutting stock problem , computer science , mathematical optimization , algorithm , optimization problem , geography , archaeology , programming language
Cutting Stock Problem (CSP) is the determination of how to cut stocks into items with certain cutting rules. A diverse set of stocks is called multiple stock CSP. This study used Pattern Generation (PG) algorithm to determine cutting pattern, then formulated it into a Gilmore and Gomory model and solved by using Column Generation Technique (CGT). Set Covering model was generated from Gilmore and Gomory model. Based on the results, selected cutting patterns in the first stage can be used in the second stage. The combination of patterns generated from Gilmore and Gomory model showed that the use of stocks was more effective than Set Covering model.