IMPLEMENTASI ALGORITMA PATTERN GENERATION DALAM PEMBENTUKAN MODEL GILMORE AND GOMORY PADA MULTIPLE STOCK SIZE CUTTING STOCK PROBLEM DUA DIMENSI
Daftar Isi:
- Two-dimensional Multiple Stock Size Cutting Stock Problem (MSSCSP) is an optimization problem in determining the most optimal cutting pattern of materials with length and width variables. The optimal cutting pattern is needed to minimize the amount of materials used. This research implemented the pattern generation algorithm to generate Gilmore and Gomory models on every variation of material sizes. The algorithm generated 63 patterns, 29 patterns, and 14 patterns which correspond to materials with a length of 24 inches, 18 inches, and 13 inches. As for the 14 inches, 13 inches, and 10 inches long material variations the algorithm generated 70 patterns, 57 patterns, and 29 patterns respectively. Then, Gilmore and Gomory models were generated according to the size of the material, where the Gilmore and Gomory model constraints ensured that strips cut in the first stage cutting were used in the second stage cutting and met all product requirements. The Branch and Bound method was then used to determine the minimum size of the material sheets needed, which were 1 sheet of 24 inches × 14 inches and 24 inches × 13 inches, 2 sheets of 18 inches × 10 inches, and 3 sheets of 13 inches × 10 inches.