An efficient model for the crosscut optimisation problem in a wood processing mill
- Additional Document Info
- View All
We propose a dynamic programming model for the crosscut optimisation problem. This problem arises in the context of cutting lumber (rip-first) in order to obtain cubic blocks (cut-pieces) with required dimensions and surface characteristics. We propose a novel approach for matching the pattern of defects on all four surfaces of an incoming strip of wood with the surface requirements of the cut-pieces as specified in a given cut-bill, and determine an effective cutting pattern for each incoming strip accordingly. Our proposed dynamic programming model results in fast execution times as shown by the results of a computational experiment. The model is deployed in a software package that has been implemented successfully in several major rough mills. © 2012 Copyright Taylor and Francis Group, LLC.
author list (cited authors)