Article ID: | iaor1993137 |
Country: | Netherlands |
Volume: | 27 |
Issue: | 2 |
Start Page Number: | 127 |
End Page Number: | 133 |
Publication Date: | May 1992 |
Journal: | International Journal of Production Economics |
Authors: | Richter Knut |
Keywords: | programming: dynamic |
A one-dimensional cutting problem recently introduced by the author is extended to the case of profit maximization. For a number of pieces of a (curtain) bale it has to be decided sequentially how they should be cut down to lengths accepted by the customers. They may cut down to single pieces and to pairs of shorter pieces, both of variable length within some boundaries. If now the profit parameters