Abstract
The cutting stock problem is used in many industrial processes and recently has been considered as one of the most important research topics. It is basically describes in two ways, One –dimensional and Two-dimensional Cutting Stock Problems (CSP). An optimum cutting stock problem can be defined as cutting a main sheet into smaller pieces while minimizing the total wastage of the raw material or maximizing overall profit obtained by cutting smaller pieces from the main sheet. In this study, One-dimensional CSP is discussed. Modified Brach and Bound algorithm for One-dimensional cutting stock problem is coded and programmed in the Matlab programming environment to generate feasible cutting patterns. At the same time, Cartesian coordinate points are derived from the developed algorithm. In our approach, the case study is pertained to the real data used at L.H. Chandrasekara & Brothers (Pvt Ltd) in Sri Lanka for its production.
Highlights
Efficiency of the production process has become a key factor of the success in today’s competitive manufacturing environment in industries
Cutting Stock Problems (CSP) is describes in two ways, One-dimensional and Twodimensional CSPs and it can be defined as cutting a raw material which is available in stock into smaller required items, which are known in size while minimizing the total wastage of the raw material or maximizing the overall profit obtained by cutting smaller items from the main sheet
Residual width of the raw material calculated by the formula bellow: W − ( w1 a111 )
Summary
Efficiency of the production process has become a key factor of the success in today’s competitive manufacturing environment in industries. Productivity can be improved by minimizing wastage, lead time and reducing the cost of production. Throughout the process of production, wastage can occur in many ways at any stage of the production process. Cutting stock problem can be defined as optimizing the raw material wastage. Techniques in Operations Research play a major role in minimizing wastage of raw material or maximizing usage of the raw material. CSP is describes in two ways, One-dimensional and Twodimensional CSPs and it can be defined as cutting a raw material which is available in stock into smaller required items, which are known in size while minimizing the total wastage of the raw material or maximizing the overall profit obtained by cutting smaller items from the main sheet. Many researchers have worked on the CSP and developed different algorithms to solve the problem. The very first formulation of the CSP was formulated by Kantorovinch in
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Systems Science and Applied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
