Abstract
One-dimensional cutting stock problem (1D-CSP) is a commonly encountered problems, which has many applications in, e.g., steel, paper and fiber industries. Cutting stock problems (CSP) involves cutting larger raw material into smaller demanded products at minimal cost and loss. When represented as integer programming problem the large number of variables involved normally makes the result infeasible. In this paper, we will describe a method that produces cutting patterns for material to minimize the loss. According to our computational analysis, it is observed that the method provides comparable solutions.