Abstract: | A large-scale forest cutting schedule problem involving 1166 forest units to be cut over a 24–year planning period is discussed. The problem is formulated as a generalized version of the basic transportation problem. The conversion procedure for such a problem to the standard transportation format is outlined. The proposed approach is then compared with a linear programming decomposition approach on the basis of operating results obtained and computer time required by each approach. It is shown that this new approach will solve a real world problem about 40 times faster than the usual linear programming decomposition approach. |