The Application to Find Cutting Patterns in Two Dimensional Cutting Stock Problem
DOI:
https://doi.org/10.26713/jims.v9i4.1024Keywords:
Cutting Stock Problem, Trim Loss, Modified Branch and Bound AlgorithmAbstract
Two dimensional Cutting Stock Problem (CSP) is a problem tofind the appropriate patterns that fulfilled the demand with different length and cut from two sides, the length and width. Two dimensional CSP aims to minimize the cutting waste that called Trim Loss. This research designed and made the application of finding cutting patterns in two dimensional CSP. Based on the results, it found that Modified Branch and Bound Algorithm makes the pattern searching become easier than manual searching. This application also yields the optimal patterns with minimum Trim Loss.
Downloads
Download data is not yet available.
Downloads
Published
2017-12-30
CITATION
How to Cite
Octarina, S., Bangun, P. B., & Hutapea, S. (2017). The Application to Find Cutting Patterns in Two Dimensional Cutting Stock Problem. Journal of Informatics and Mathematical Sciences, 9(4), 1269–1276. https://doi.org/10.26713/jims.v9i4.1024
Issue
Section
Research Articles
License
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.