Flexible Heuristics for Project Scheduling with Limited Resources

Resource-constrained project scheduling is an NPhard optimisation problem. There are many different heuristic strategies how to shift activities in time when resource requirements exceed their available amounts. These strategies are frequently based on priorities of activities. In this paper, we assume that a suitable heuristic has been chosen to decide which activities should be performed immediately and which should be postponed and investigate the resource-constrained project scheduling problem (RCPSP) from the implementation point of view. We propose an efficient routine that, instead of shifting the activities, extends their duration. It makes it possible to break down their duration into active and sleeping subintervals. Then we can apply the classical Critical Path Method that needs only polynomial running time. This algorithm can simply be adapted for multiproject scheduling with limited resources. Keywords—Project management, resource-constrained scheduling, NP-hard problem, CPM, heuristic method.

[1]  K. Bouleimen,et al.  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..

[2]  Francisco Ballestín,et al.  Resource-constrained project scheduling: A critical activity reordering heuristic , 2003, Eur. J. Oper. Res..

[3]  Erik Demeulemeester,et al.  A note on the paper "Resource-constrained project scheduling: Notation, classification, models and methods" by Brucker et al , 2001, Eur. J. Oper. Res..

[4]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[5]  Grzegorz Waligóra,et al.  Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models , 2005, Eur. J. Oper. Res..

[6]  Christian Artigues,et al.  Insertion techniques for static and dynamic resource-constrained project scheduling , 2003, Eur. J. Oper. Res..

[7]  Mitsuo Gen,et al.  Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling , 2005, Comput. Ind..

[8]  Amir Azaron,et al.  A genetic algorithm approach for the time-cost trade-off in PERT networks , 2005, Appl. Math. Comput..

[9]  Lin-Yu Tseng,et al.  A hybrid metaheuristic for the resource-constrained project scheduling problem , 2006, Eur. J. Oper. Res..

[10]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[11]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[12]  Mitsuo Gen,et al.  Hybrid genetic algorithm with fuzzy logic for resource-constrained project scheduling , 2003, Appl. Soft Comput..

[13]  Xiaodong Li,et al.  Particle swarm optimization-based schemes for resource-constrained project scheduling , 2005 .