A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry

To cut reinforcing bars for concrete buildings, machines are used which have compartments to store the cut orders until the requirement is met. Number and size of these compartments restrict kind and processing sequence of possible cutting patterns. In this paper we present the so-called “Sequencing algorithm” that tackles the problem of finding a processing sequence for the cutting patterns starting from an integer solution of the cutting stock problem and using an interpretation of relations between orders in patterns as a graph. Computational results are reported.