IMPLEMENTASI COLUMN GENERATION TECHNIQUE DAN ALGORITMA BALAS YANG DIKEMBANGKAN DALAM PENYELESAIAN CUTTING STOCK PROBLEM (CSP) SATU DIMENSI
Daftar Isi:
- One-dimensional Cutting Stock Problem (CSP) is one of the optimization problem in the case of combining cutting patterns. This study used Column Generation Technique (CGT) and the Balas algorithm developed to solve the optimal cutting pattern of one-dimensional CSP on two problems. Based on the results and discussion, if problem-1 using CGT, the optimal cutting pattern was as much as 31 flyer, while Balas algorithm developed did not produce an optimal solution because the solution was not binary. The optimal cutting pattern in problem-2 were the first cutting pattern which produced 1 roll of 7 metres length and 1 roll of 3 metres length, the third cutting pattern which produced 2 roll of 3 metres length and 1 roll of 4 metres length, the fourth cutting pattern which produced 2 roll of 4 metres length. While Balas algorithm developed generated first, second, and fourth cutting pattern as the optimal solution.