Abstract
Purpose: The main objective of this study is to develop a model for solving the one dimensional cutting stock problem in the wood working industry, and develop a program for its implementation.Design/methodology/approach: This study adopts the pattern oriented approach in the formulation of the cutting stock model. A pattern generation algorithm was developed and coded using Visual basic.NET language. The cutting stock model developed is a Linear Programming (LP) Model constrained by numerous feasible patterns. A LP solver was integrated with the pattern generation algorithm program to develop a one - dimensional cutting stock model application named GB Cutting Stock Program.Findings and Originality/value: Applying the model to a real life optimization problem significantly reduces material waste (off-cuts) and minimizes the total stock used. The result yielded about 30.7% cost savings for company-I when the total stock materials used is compared with the former cutting plan. Also, to evaluate the efficiency of the application, Case I problem was solved using two top commercial 1D-cutting stock software. The results show that the GB program performs better when related results were compared.Research limitations/implications: This study round up the linear programming solution for the number of pattern to cut.Practical implications: From Managerial perspective, implementing optimized cutting plans increases productivity by eliminating calculating errors and drastically reducing operator mistakes. Also, financial benefits that can annually amount to millions in cost savings can be achieved through significant material waste reduction.Originality/value: This paper developed a linear programming one dimensional cutting stock model based on a pattern generation algorithm to minimize waste in the wood working industry. To implement the model, the algorithm was coded using VisualBasic.net and linear programming solver called lpsolvedll (dynamic link library) was integrated to develop a one dimensional cutting stock Program.
Highlights
A cutting stock problem (CSP) basically consists of cutting large pieces available in stock to produce smaller pieces in order to meet a given demand
This paper developed a linear programming one dimensional cutting stock model based on a pattern generation algorithm to minimize waste in the wood working industry
The text solution gives the description of patterns to be cut, total number of stock to be used and its cost; while visual solution shows the diagram of how the optimal pattern is to be cut
Summary
A cutting stock problem (CSP) basically consists of cutting large pieces available in stock to produce smaller pieces (called items) in order to meet a given demand. The cutting is planned to minimize waste of the stock material (other objectives may arise). These objectives may be to minimize trim loss, the number of cutting lines or production cost, maximize profit and so on. The objective is to minimize the number of used stock lengths or, equivalently, trim loss (waste) (Murat, Urfat & Ahmet, 2011). This type of problem occurs in several industries such as paper, aluminium, steel, glass, and furniture industry among others. This type of problem occurs in several industries such as paper, aluminium, steel, glass, and furniture industry among others. Kallrath, Rebennack, Kallrath and Kusche (2014) solved cutting stock problem in the pulp and paper industry with the objective of minimizing the number of rolls and the patterns, thereby preventing overproduction
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
