A heuristic weight determination procedure for goal programs used for harvest scheduling models

Abstract

A heuristic, "unstructured" weight determination procedure was developed for harvest scheduling models in which goal programming algorithms are employed. Six noninferior solution sets that included four goals, total volume harvested, total discounted cash flow, total undiscounted cash flow, and total discounted costs, were generated using a complementary linear and goal programming approach. Representatives from a pulp and paper company (The Company) located in the southeastern United States ranked the solution sets from most to least preferred and provided a statement of why they ranked the sets the way they did. Additional noninferior solutions were generated to improve the achievement levels of the initial preferred solution. The procedure contributes to improved forest management decisions by providing the optimal harvest scheduling plan under each of the four goals individually and by providing goal achievement level trade offs under different weight structures. The procedure was well received and instructive to The Company representatives since it was easy to understand and required minimal analytic expertise and time on the part of the decision makers.