A search strategy for the one-size assortment problem

The problem of determining the optimal length of a board with fixed width from which panels have to be cut to satisfy some specified demand with minimum waste is analysed. The proposed procedure generates a lower bound on the best solution that can be obtained for each of the board length values within the allowed range. This lower bound contour is updated each time after a potentially good board length is analysed. The search stops when the solution is within a pre-specified error. This new algorithm is much better than a previously suggested method by Yanasse, Zinober and Harris to solve the same problem.