Strategy evaluation for stochastic scheduling problems with order constraints

A single machine is available to process a collection J of jobs. The machine is free to switch between jobs at any time, but processing must respect a set .of precedence constraints. Jobs evolve stochastically and earn rewards as they are processed, not otherwise. The theoretical framework of forwards induction/Gittins indexation is used to develop approaches to strategy evaluation for quite general (J,.). The performance of both forwards induction strategies and a class of quasi-myopic heuristics is assessed.