Open AccessThe modified branch and bound algorithm and dotted board model for triangular shape items
Author(s) -
Sisca Octarina,
Madren-Whalley Janna,
Endro Sastro cahyono,
Putra Bahtera Jaya Bangun,
Laila Hanum
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1480/1/012065
Subject(s) - trim , mathematics , mbba , algorithm , combinatorics , computer science , structural engineering , engineering , materials science , liquid crystal , optoelectronics
Cutting Stock Problem (CSP) is a problem of cutting stocks into items with certain cutting rules. This study used the data where the rectangular stocks were cut into triangular shape items with various order sizes. This study used the Modified Branch and Bound Algorithm (MBBA) to determine the optimal cutting pattern then formulated it into a Dotted Board model. Based on the results, it showed that the MBBA produced three optimal cutting patterns, which used 6 times, 8 times, and 4 times respectively to fulfill the consumer demand. Then the cutting patterns were formulated into the Dotted Board model. Minimum trim loss of the three models are 1,774 cm 2 , 1,720 cm 2 dan 980 cm 2 .