Set Covering Model in Solving Multiple Cutting Stock Problem

Abstract

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 stocks. This study used the Pattern Generation (PG) algorithm to determine the cutting pattern of three sizes of stocks, then formulated them into the Gilmore and Gomory Model. The set covering model was generated from the Gilmore and Gomory model. There are two stages of cutting where the first stage is based on the length and the second stage is based on the width. Based on the results, selected cutting patterns in the first stage can be used in the second stage. The combination of patterns produced in the Gilmore and Gomory model showed that the use of stocks is less than the use of stocks in the set covering model.