Resource‐Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations
研究了随机活动工期下资源受限项目调度问题，分析了多种与及时完工相关的目标函数及其相关性，开发了基于GRASP的启发式算法，在期望完工时间最小化上优于现有算法。
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.