Text
IMPLEMENTASI ALGORITMA GREEDY HEURISTIC DALAM PENENTUAN POLA PEMOTONGAN OPTIMAL PADA CUTTING STOCK PROBLEM DUA DIMENSI PERCETAKAN XXX DI KOTA PALEMBANG
Optimizing the cutting pattern has an important role for the printing industry in determining the cutting pattern of raw materials (stock) to increase profits and minimize trim loss. Trim loss is the remnant of cutting paper that can’t be used anymore. This study optimized the cutting patterns in the two-dimensional Cutting Stock Problem of an XXX printing in Palembang, where the cutting process only considers the width and length of raw materials, resulting in a trim loss on both sides. We used the Gilmore and Gomory model and then solved it with the Greedy Heuristic Algorithm. The optimal solution from the Greedy Heuristic algorithm will then be compared with the solution from the Genetic algorithm that has been obtained in previous studies. Based on the results and discussion, there are five optimal cutting pattern based on the width, namely the 1st, 2nd, 3rd, 4th, and 5th cutting patterns, and five optimal cutting patterns on the length, namely the 3rd, 4th,6th, 7th, and 8th cutting patterns. The Greedy Heuristic Algorithm produces fewer combinations of cutting patterns than the Genetic Algorithm. Keywords: Cutting Stock Problem, Gilmore and Gomory, Greedy Heuristic, Cutting Pattern.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2207001110 | T65647 | T656472022 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available