CD Skripsi
Optimisasi Permasalahan Pemotongan Stok Dengan Panjang Stok Ganda Menggunakan Metode Pembangkit Kolom
In general, the stock cutting problem is a problem of standard cutting of a ma terial into pieces of a predetermined size according to the amount of demand and optimizing a certain objective function. This research develops a standa rd stock cutting rule at the wooden pallet company CV. Triyunda Jaya with multiple stock length size so it can generate the best cutting pattern with mi nimum scrap to optimize the use of standard stock and production costs. The application of this regulation will form a linear programming model to develop a cutting strategy by solving with column generation method. This problem solved with LINGO 19.0 to quickly formulate and solve problems and minimize errors in calculations. The results of data processing get 8 patterns of cutting standard stock with a total number of standard stock used is 12625 standard stock rods to cover all requests. Based on the research results, the composition of the cutting pattern is very influential in minimizing scrap in production but still able to fulfill all orders from the column generator algorithm that has been compiled. This is because the column generation method can produce a suitable cutting pattern.
Keywords: Cutting stock problem, column generation, linear programming, simplex method, dual problem
Tidak tersedia versi lain