A REAL-TIME ONE-DIMENSIONAL CUTTING STOCK ALGORITHM FOR BALANCED CUTTING PATTERNS

In the steel industry when a finished structural shape, exits the mill upon which it was produced, it is cut into customer order lengths. Th e actual length of the finished I-beam bar may not be known precisely until immediately before cutting. Also if the mill can produce bars fa ster than they can be cut, then trying to generate cutting patterns wi th the number of cuts per bar close to the average number of cuts per bar (balanced cutting patterns) will maximize primary saw (hotsaw) cut ting and reduce the number of (more costly) cuts that have to be made at the secondary saw (coldsaw). In this paper, a PC-based branch-and-b ound algorithm, DYNACUT, is discussed that generates high-yield, balan ced cutting patterns in real-time (maximum three seconds/bar pattern g eneration time on a 486 machine) based on the precise length of the ba r determined as it leaves the mill and arrives at the hotsaw for prima ry cutting. Examples based on actual orders will illustrate both the e fficiency and effectiveness of this algorithm.