APPLICATION OF PATTERN GENERATION ALGORITHM IN SOLVING THE CUTTING STOCK PROBLEM MODEL IN MINIMIZING THE REMAINING CUTTING OF IRON RAW MATERIALS Inneke Cantika Angelin Dwita, Fitri Maya Puspita, Sisca Octarina
Faculty of Mathematics and Natural Sciences, Sriwijaya University
Abstract
Cutting Stock Problem (CSP) is one of the optimization problems that often occurs in the manufacturing or production industry that involves cutting materials such as iron, wood, glass, pipes, or fabrics. This problem is concerned with cutting raw materials into smaller pieces using the available raw materials. The goal of CSP is to minimize the waste or scrap generated in the cutting process. Solving CSP can provide many benefits to the company. Optimizing the use of materials allows companies to reduce waste, lower production costs, and enhance supply chain efficiency. In addition, CSP also contributes to environmental sustainability by reducing the amount of waste generated. This research discusses how to solve the PG algorithm for one-dimensional CSP iron material cutting. The resulting optimal cutting patterns result in the reduction of unused material scraps.
Keywords: Cutting Stock Problem (CSP), Pattern Generation, stock
