Journal of Advances in Mathematics and Computer Science

Increasing cost of raw material and need to avoid industrial wastage, solving cutting stock problems became of great interest in the area of Operations Research. An optimum cutting stock problem can be defined as cutting a main sheet into smaller pieces while minimizing total wastage of the raw material or maximizing overall profit obtained by cutting smaller pieces from the main sheet. Objective of this study is to generate feasible cutting patterns for two-dimensional triangular shape cutting items. An algorithm is presented based on modified Branch and Bound Algorithm. A computer program is developed using Matlab software package to generate feasible cutting patterns. As a case study, four different sizes of triangular shape items with their demands are selected to cut from a main sheet with known dimensions. Applying proposed algorithm, demand is satisfied and total wastage is minimized. Proposed algorithm can be exploited to generate cutting patterns for rectangular and triangular cutting items at the same time and more suitable for medium size two dimensional cutting stock problem.