Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming (Q1821036)

The simultaneous choice of land-use allocation and production scheduling on forest lands is a complex management problem that is best addressed using integer programming. This paper presents the general form of the allocation and scheduling problem, provides two empirical examples that reflect two distinct problem types and presents strategies for increasing the efficiency with which one can solve larger-scale empirical problems. The mixed-integer linear programming techniques presented in this paper capitalize on the special structure of each problem type and explore the possibility of reducing the solution effort. Inherent in type one problems is a distinct relationship among the allocation variables that can be exploited to help reduce the number of integer variables as well as the allocation constraints. For problems of type two, however, there exists a set of multiple choice allocation constraints which can also be exploited for better solution performance.