On the evaluation of strategies for stochastic scheduling problems with order constraints

In some earlier work the author presented a characterization of optimal strategies for a class of stochastic scheduling problems with order constraints. However it is in general difficult to obtain optimal strategies explicitly from this characterization, Here we present some theoretical developments of the previous work which yields methods for evaluating general strategies. Two examples are discussed in detail.