A heuristic for network project scheduling with random activity durations depending on the resource allocation

Abstract This paper presents a heuristic for resource-constrained network project scheduling. A PERT-type project, where activities require resources of various types with variable capacities, is considered. Each activity is of random duration depending on the resource amounts assigned to that activity. The problem is to minimize the expected project duration by determining for each activity its starting time and the assigned resource capacities. The resource project scheduling model is an NP-complete knapsack resource reallocation problem. To obtain a precise solution, a lookover algorithm has been developed. For the case when a lookover requires mmuch computational time, an approximate heuristic algorithm is suggested. The problem has to be solved at each decision point, when at least more than one activities are ready to be operated but the available amount of resources is limited. The heuristic model is illustrated by a numerical example.

[1]  Gündüz Ulusoy,et al.  A heuristic scheduling algorithm for improving the duration and net present value of a project , 1995 .

[2]  Raymond H. Myers,et al.  Probability and Statistics for Engineers and Scientists. , 1973 .

[3]  Hanan Luss.  A nonlinear minimax allocation problem with multiple knapsack constraints , 1991, Oper. Res. Lett..

[4]  Avraham Shtub,et al.  Project management: engineering, technology, and implementation , 1994 .

[5]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints , 1995 .

[6]  Colin E. Bell,et al.  A new heuristic solution method in resource‐constrained project scheduling , 1991 .

[7]  Elliott N. Weiss,et al.  Local search techniques for the generalized resource constrained project scheduling problem , 1993 .

[8]  Aw Pearson.  Planning and control in research and development , 1990 .

[9]  Riccardo Minciardi,et al.  Development of a heuristic project scheduler under resource constraints , 1994 .

[10]  Aysegul Toker,et al.  Scheduling under a Non-renewable Resource Constraint , 1991 .

[11]  Robert J Willis.  Critical path analysis and resource constrained project scheduling -- Theory and practice , 1985 .

[12]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

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

[14]  Z. Sinuany-Stern,et al.  Production control in semi-automated systems: comparison between constant and stochastic speeds , 1996 .

[15]  Fayez F. Boctor,et al.  Resource-constrained project scheduling by simulated annealing , 1996 .

[16]  R. H. Myers,et al.  Probability and Statistics for Engineers and Scientists , 1978 .

[17]  Ji Zhan,et al.  Heuristics for scheduling resource-constrained projects in MPM networks , 1994 .