A Useful Theorem in the Dynamic Programing Solution of Sequencing and Scheduling Problems Occurring in Capital Expenditure Planning

The dimensionality of certain sequencing and scheduling problems can be reduced by exploiting their special structures. An example of this type of reduction of dimensionality is presented in the form of a theorem. The use of the theorem in the dynamic programing solution of a previous example is discussed. Sufficient conditions for the optimality of a myopic decision rule are also shown to be a special case of the theorem.