Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- 1 June 1983
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 31 (3) , 573-586
- https://doi.org/10.1287/opre.31.3.573
Abstract
We propose two combinatoric methods that generate constrained cutting patterns by successive horizontal and vertical builds of ordered rectangles. Each of the algorithms uses a parameter to bound the maximum acceptable percentages of waste they create. Error bounds measure how close the pattern wastes are to the waste of the optimal solution. We also discuss computational results and applications of the methods to a general cutting stock problem.Keywords
This publication has 0 references indexed in Scilit: