Skip to content
naulon
Not checkedNot checked for notices yet.

SOLVING CUTTING STOCK PROBLEM USING PATTERN GENERATION METHOD ON 2-DIMENSIONAL STOCK

Ihda Hasbiyati, Indri Latifa, Abdul Rahman and 2 more

Barekeng · 2025

doi:10.30598/barekengvol19iss1pp303-318 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

This article discusses the solution of the 2-dimensional stock cutting problem using the Branch and Bound modified pattern generation method. The pattern generation method will produce a feasible cutting pattern matrix which is then converted into a mathematical model with a linear program equation with an objective function to minimize the use of initial stock materials. The research is a case study located at the Handal Karya Buana Store which is engaged in cutting glass of different sizes, thicknesses and types of glass. In this case, 3 types of initial stock will be used with the same thickness, and type but have different area sizes, and one of the consumer demand data will be used, namely 3 types of requests with different sizes and many requests. By using the pattern generator method, 10 cutting patterns are generated with each different cutting residue. By using the simplex method, the optimal solution is obtained for the amount of initial stock needed, the pattern used and the remaining cuts produced. So using the pattern generator method can produce a feasible cutting pattern, and can be used as an alternative to solve the stock cutting problem.

Abstract licence: CC BY-SA

References15

    15 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.