Mathematical solution for optimising the sawing pattern of a log given its dimensions and its defect core

The mathematical solution for a two-dimensional cutting problem of an irregular space presented is capable of being extended to a third dimension. The computer program based on this algorithm uses information on marketable timber assortments (dimensions, prices for the various grades, and dressing) to optimise the sawing pattern for a specified log with a certain defect core. In the two-dimensional examples three grades are recognised: clear boards, one face clear, and knotty grade boards. The run time on a single processor is extensive and real-time on-line applications will be realistic only using a multi-processor, for which the dynamic programming algorithm described is highly suited