Schrage and Baker (1978) proposed a generic dynamic programming (DP) algorithm to tackle precedenceconstrained sequencing on a single machine. The performance of their DP method, however, is limited due to excessive memory requirements, particularly when the precedence network is not very dense....

We study the stochastic resource-constrained project scheduling problem or SRCPSP, where project activities have stochastic durations. A solution is a scheduling policy, and we propose a new class of policies that is a generalization of most of the classes described in the literature. A policy...