The Application to Find Cutting Patterns in Two Dimensional Cutting Stock Problem

Authors

  • Sisca Octarina Department of Mathematics, Faculty of Mathematics and Natural Sciences, Sriwijaya University, Indralaya
  • Putra B.J. Bangun Department of Mathematics, Faculty of Mathematics and Natural Sciences, Sriwijaya University, Indralaya
  • Samuel Hutapea Department of Mathematics, Faculty of Mathematics and Natural Sciences, Sriwijaya University, Indralaya

DOI:

https://doi.org/10.26713/jims.v9i4.1024

Keywords:

Cutting Stock Problem, Trim Loss, Modified Branch and Bound Algorithm

Abstract

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