TY - JOUR

T1 - Solving sequential interval cutting problems via dynamic programming

AU - Richter, Knut

PY - 1992/3/26

Y1 - 1992/3/26

N2 - A new sequential one-dimensional cutting problem is studied in this paper. For a number of pieces of a tape or a bale has to be decided sequentially whether a piece is to be cut to smaller pieces of minimal/maximal length a and b, respectively, or if some part x is to be combined with some part y of the next piece. These parts must have a minimal length c and their sum should not be less than a nor greater than b. A cutting solution is needed which minimizes the unusable rest. A dynamic programming approach is offered in the paper to this problem as well as a modification. Real-life problems of cutting curtain bales have been solved by a corresponding PASCAL program on a personal computer.

AB - A new sequential one-dimensional cutting problem is studied in this paper. For a number of pieces of a tape or a bale has to be decided sequentially whether a piece is to be cut to smaller pieces of minimal/maximal length a and b, respectively, or if some part x is to be combined with some part y of the next piece. These parts must have a minimal length c and their sum should not be less than a nor greater than b. A cutting solution is needed which minimizes the unusable rest. A dynamic programming approach is offered in the paper to this problem as well as a modification. Real-life problems of cutting curtain bales have been solved by a corresponding PASCAL program on a personal computer.

KW - cutting

KW - Dynamic programming

UR - http://www.scopus.com/inward/record.url?scp=0026836821&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(92)90344-9

DO - 10.1016/0377-2217(92)90344-9

M3 - Article

AN - SCOPUS:0026836821

VL - 57

SP - 332

EP - 338

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -