Optimal start times under stochastic activity durations

We treat the problem of sequencing n activities on a single facility with the objective of determining their start times to maximize an economic gain, subject to restrictions on their availabilities. The activities possess random durations. We present a dynamic programming model that determines the optimal value and yields the desired start times, which also imply the optimal sequence. An approximation is also offered to lighten the computing burden somewhat.