A branch and bound algorithm for minimizing expected makespan in stochastic project networks with resource constraints

not available

not available

We present a branch and bound approach for the resource constrained project scheduling problem where activity durations are assumed to be random according to some joint probability distribution. Our aim is to compute a policy that minimizes the expected project makespan. We compare three classes of scheduling policies that fulfill certain requirements of stability and are suitable for dealing with stochastic activity durations. Extensive computational experiences exhibit that the class of so-called linear preselective policies is the most appropriate class.

The report may be requested from our secretary Gabriele Klink, email: klink@math.tu-berlin.de