ONE-DIMENSIONAL CUTTING STOCK PROBLEM THAT MINIMIZES THE NUMBER OF DIFFERENT PATTERNS

Abstract

Cutting stock problems (CSP) is a problem of determining the best way so that large objects can be cut into smaller objects on demand and with minimum waste. However, besides minimizing material waste, there is another problem with CSP, which is minimizing different cutting patterns. This is because there will be setup costs for each different pattern that is cut out. This research aims to obtain the optimal number of different patterns on a problem, so the cutting costs are minimized. A problem about the construction of 12 pavilions will be modelled into a linear program and then solved using a column generation algorithm using Lingo 18.0 software.