The problem of cutting planks from sleepers is basically a three- dimensional cutting stock problem but due to practical constraints, it has been formulated and solved as a two-dimensional cutting problem. The resulting linear programming problem cannot be solved by using standard LP packages available as the number of columns of the matrix A runs into millions and are unknown. The columns of matrix A represent the cutting patterns. A special computer package has been developed which generates the cutting patterns as and when required by solving a knapsack problem. Computational experience with a large problem is mentioned. The original problem was finally split up into four subproblems and each solved separately. This study helped in reducing the avoidable wastage by about 50\% of the avoidable wastage earlier.
- Knowledge based approach to the cutting stock problem
- Solution procedures for cutting lumber into furniture parts
- Optimising the cutting of wood fibre plates in the hardboard industry
- Une étude pratique de découpes de panneaux de bois
- Application of Mathematical Programming to the Plywood Design and Manufacturing Problem
- A PC-based decision support system for optimal cutting of logs in veneers production
This page was built for publication: Wastage reduction in wood cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820679)
