论文信息 - Heuristic Algorithm in Optimizing Stochastic Resource-Constrained Project Scheduling

Heuristic Algorithm in Optimizing Stochastic Resource-Constrained Project Scheduling

This paper presents a newly developed resource constrained project scheduling method in stochastic networks by using critical chain concept. The objective of the presented model is defined as minimizing the multiplication of expected project duration and its variance. This paper suggests a competition routine by implementing a policy to maximize the total contribution of selected activities in reducing the expected project duration and its variance. In this respect, a heuristic algorithm is developed and compared with the other existing methods.

Li Ma | Min He | Fang Ming Guo

[1] Walter O. Rom,et al. An investigation of buffer sizing techniques in critical chain scheduling , 2006, Eur. J. Oper. Res..

[2] Rainer Kolisch,et al. PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[3] Rainer Kolisch,et al. PSPLIB - a project scheduling problem library , 1996 .

[4] Dimitri Golenko-Ginzburg,et al. Stochastic network project scheduling with non-consumable limited resources , 1997 .

[5] Terry Williams. Criticality in Stochastic Networks , 1992 .

[6] S. Selcuk Erenguc,et al. A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows , 1996 .

[7] Dimitri Golenko-Ginzburg,et al. A heuristic for network project scheduling with random activity durations depending on the resource allocation , 1998 .