Asset Details
Do you wish to reserve the book?
The modified branch and bound algorithm and dotted board model for triangular shape items
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
The modified branch and bound algorithm and dotted board model for triangular shape items
Do you wish to request the book?
The modified branch and bound algorithm and dotted board model for triangular shape items
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
The modified branch and bound algorithm and dotted board model for triangular shape items
2020
Overview
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.
Publisher
IOP Publishing
Subject
