Column Generation Model in Capacitated Multi-Periods Cutting Stock Problem with Pattern Set-Up Cost

Putra Bahtera Jaya Bangun
Sisca Octarina (Universitas Sriwijaya)
Laila Hanum
Ranti Sawitri
Endro Sastro Cahyono

Science and Technology Indonesia
Vol. 6 No. 1 (2021): January

Cutting Stock Problem (CSP) determines the cutting of stocks with standard length and width to meet the item’s demand. The optimal cutting pattern will minimize the usage of stocks and trim loss. This research implemented the pattern generation algorithm to form the Gilmore-Gomory and Column Generation model in two-dimensional CSP. The CSP in this research had three periods of cutting with different capacities in each period. The Column Generation model added the pattern set-up cost as the constraint. The Gilmore-Gomory model ensured that the first stage’s strips were used in the second stage and met the item’s demand. Based on the Column Generation model’s solution, the 1st period used the 2nd, 4th, and 5th patterns, the 2nd period used 4th and 5th patterns, and the 3rd period did not use any patterns. The first and second periods fulfilled all of the demands.