Cutting and Reuse: An Application from Automobile Component Manufacturing
- 1 December 2002
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 50 (6) , 923-934
Abstract
This paper presents a decision support tool for solving a cutting and reuse problem arising in a European plant devoted to the production of gear belts. In this production, rectangular pieces of rubberised nylon are cut using machines employing parallel blades, so as to obtain rectangular components of identical height and (possibly) different width. A component is then used to produce a set of belts with the same girth; but, if necessary, the girth required can also be obtained by sewing together two components. The major objectives of optimisation are: trim loss minimisation, quality control, workload equalisation, setup minimisation. The problem, a particular one-dimensional cutting stock with both cutting and reuse decision variables, has been formulated in terms of integer linear programming and then efficiently solved by applying standard packages within a column generation scheme. A significant improvement of performance has been obtained in terms of both economic savings and product quality. This has convinced the management to implement the model in the plant operation.Keywords
This publication has 9 references indexed in Scilit:
- Computational study of a column generation algorithm for bin packing and cutting stock problemsMathematical Programming, 1999
- Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock ProblemsOperations Research, 1999
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- Branch-and-Price Algorithms for the One-Dimensional Cutting Stock ProblemComputational Optimization and Applications, 1998
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper IndustrySIAM Review, 1997
- The cutting stock problem and integer roundingMathematical Programming, 1985
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961