Abstract
A series of controlled jump process models is presented for stochastic scheduling problems. In each case, the optimality principle of dynamic programming is used to reduce the problem to a deterministic optimal control problem. Applying the maximum principle to this deterministic problem yields necessary optimality conditions. These enable explicit optimal scheduling strategies to be found for a number of problems.

This publication has 4 references indexed in Scilit: