Article ID: | iaor1991219 |
Country: | Netherlands |
Volume: | 44 |
Issue: | 2 |
Start Page Number: | 224 |
End Page Number: | 231 |
Publication Date: | Jan 1990 |
Journal: | European Journal of Operational Research |
Authors: | Haessler Robert W., Sweeney Paul E. |
Keywords: | cutting plane algorithms |
This paper presents a procedure for solving one-dimensional cutting stock problems when both the master rolls and customer orders have multiple quality gradations. The procedure described here is a two-stage sequential heuristic. An innovative shadow price-based procedure is first used to select slitting patterns for master rolls with variable quality characteristics. Then a residual problem for the available first-quality (‘perfect’) master rolls is solved with a linear programming model. An important characteristic of this approach is its robustness. The procedure can deal effectively with problems of varying size and complexity and can also easily be adapted to changing circumstances with respect to production quality and demand.