Penyelesaian dalam Persoalan Pemotongan Stok

Abstract

Standard-size pipe cutting into some parts that matched consumer request being important aspect for a company, the purpose to find cutting pattern combination which can minimize residual cuts or minimize the amount of stock used. Standard-sized cutting problem stock into some parts also called as one-dimensional cutting stock problem, which aim of looking for cutting pattern for minimizing residual cut. In this article, the illustration is presented to implement one-dimensional cutting stock problem. The illustration resolved with column generation technique to obtain knapsack form and the knapsack problem resolved with dynamic programming. The results show that optimum cutting pattern solution can fulfill demand requests with minimum stock