Octarina, Siska and Janna, M and Cahyono, Endro Setyo and Bangun, Putra Bahtera Jaya and Hanum, Laila (2020) The modified branch and bound algorithm and dotted board model for triangular shape items (Peer Review). Fakultas MIPA, Universitas Sriwijaya. (Unpublished)
Preview |
Text
Artikel 26.pdf Download (553kB) | Preview |
Abstract
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 2dan 980 cm 2.
| Item Type: | Other |
|---|---|
| Subjects: | |
| Divisions: | 08-Faculty of Mathematics and Natural Science > 46201-Biology (S1) |
| Depositing User: | Laila Hanum |
| Date Deposited: | 08 Sep 2021 15:26 |
| Last Modified: | 08 Sep 2021 15:26 |
| URI: | http://repository.unsri.ac.id/id/eprint/52882 |
Actions (login required)
 |
View Item |