.png){kind=icon}
Return
SOLVING SEQUENTIAL INTERVAL CUTTING PROBLEMS VIA DYNAMIC-PROGRAMMING
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90344-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
DYNAMIC PROGRAMMING
CUTTING
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
.png){kind=icon}
