Abstract

We investigate resource‐constrained project scheduling with stochastic activity durations. Various objective functions related to timely project completion are examined, as well as the correlation between these objectives. We develop a GRASP‐heuristic to produce high‐quality solutions, using so‐called descriptive sampling. The algorithm outperforms existing algorithms for expected‐makespan minimization. The distribution of the possible makespan realizations for a given scheduling policy is also studied.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call