Multi-mode resource constrained project scheduling: scheduling schemes, priority rules and mode selection rules

This work deals with the multi-mode resource-constrained project scheduling problem. In this problem, activities of the project may be executed in more than one operating mode and renewable resource constraints exist. Each activity operation mode has a different duration and requires different amount of renewable resources. The objective function considered is the minimisation of the project completion time. Heuristics based on priority rule are considered as solution procedures for this problem. Both, parallel and serial scheduling generation schemes are described in the multi-mode context. On the basis of a well-known set of project instances, the new heuristics based on priority rules are evaluated against the best ones published. Finally, multi-pass heuristics based on priority rules that outperforms the deterministic multi-pass heuristic previously published are designed.

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

[2]  Gündüz Ulusoy,et al.  A local constraint based analysis approach to project scheduling under general resource constraints , 1994 .

[3]  Pilar Tormos,et al.  The Evolution of Software Quality in Project Scheduling , 1999 .

[4]  Sönke Hartmann,et al.  Project Scheduling with Multiple Modes: A Genetic Algorithm , 2001, Ann. Oper. Res..

[5]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[6]  Robert Klein,et al.  Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects , 2000, Eur. J. Oper. Res..

[7]  María Pilar Tormos,et al.  Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling , 2001, Ann. Oper. Res..

[8]  Andreas Drexl,et al.  Nonpreemptive multi-mode resource-constrained project scheduling , 1993 .

[9]  Linet Özdamar,et al.  A genetic algorithm approach to a general category project scheduling problem , 1999, IEEE Trans. Syst. Man Cybern. Part C.

[10]  Masao Mori,et al.  A genetic algorithm for multi-mode resource constrained project scheduling problem , 1997, Eur. J. Oper. Res..

[11]  RAINER KOLISCH,et al.  Local search for nonpreemptive multi-mode resource-constrained project scheduling , 1997 .

[12]  Arno Sprecher,et al.  Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm , 1998, Eur. J. Oper. Res..

[13]  Rainer Kolisch,et al.  Local search for nonpreemptive multi-mode resource-constrained project scheduling , 1997 .

[14]  Erik Demeulemeester,et al.  The discrete time/resource trade-off problem in project networks: a branch-and-bound approach , 2000 .

[15]  F. F. Boctor Heuristics for scheduling projects with resource restrictions and several resource-duration modes , 1993 .

[16]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

[17]  Rainer Kolisch Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[18]  Fayez F. Boctor,et al.  A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes , 1996 .

[19]  Roman Slowinski,et al.  Multiobjective project scheduling under multiple-category resource constraint , 1989 .

[20]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[21]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[22]  Arno Sprecher,et al.  An exact algorithm for project scheduling with multiple modes , 1997 .