A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Cutting Stock Problem (CSP) is a problem of cutting stocks with certain cutting rules. This study used the data of rectangular stocks, which cut into triangular shape items with various order sizes. The Modified Branch and Bound Algorithm (MBBA) was used to determine the optimum cutting pattern then formulated it into the 3-Phase Matheuristic model which consisted of constructive phase, improvement phase, and compaction phase. Based on the results, it showed that the MBBA produces three optimumdoi:10.26554/sti.2020.5.1.23-27 fatcat:5xs5t3kjprew5hz7f3xqcojlwy