A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version

This paper describes new simulated annealing (SA) algorithms for the resource-constrained project scheduling problem (RCPSP) and its multiple mode version (MRCPSP). The objective function considered is minimisation of the makespan. The conventional SA search scheme is replaced by a new design that takes into account the specificity of the solution space of project scheduling problems. For RCPSP, the search was based on an alternated activity and time incrementing process, and all parameters were set after preliminary statistical experiments done on test instances. For MRCPSP, we introduced an original approach using two embedded search loops alternating activity and mode neighbourhood exploration. The performance evaluation done on the benchmark instances available in the literature proved the efficiency of both adaptations that are currently among the most competitive algorithms for these problems.

[1]  James H. Patterson,et al.  A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem , 1984 .

[2]  Hartmut Schmeck,et al.  Experiences with fine‐grainedparallel genetic algorithms , 1999, Ann. Oper. Res..

[3]  F. F. Boctor,et al.  Some efficient multi-heuristic procedures for resource-constrained project scheduling , 1990 .

[4]  V. Maniezzo,et al.  An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .

[5]  K. Haase,et al.  Experiences with Fine-Grained Parallel Genetic Algorithms , 1996 .

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

[7]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

[8]  Erik Demeulemeester,et al.  New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .

[9]  P. Brucker,et al.  Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problem , 1999 .

[10]  Erik Demeulemeester,et al.  Resource-constrained project scheduling: A survey of recent developments , 1998, Comput. Oper. Res..

[11]  Jan Węglarz,et al.  Project scheduling : recent models, algorithms, and applications , 1999 .

[12]  Sönke Hartmann,et al.  Project scheduling with multiple modes: A comparison of exact algorithms , 1998, Networks.

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

[14]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[15]  Concepción Maroto,et al.  A Robust Genetic Algorithm for Resource Allocation in Project Scheduling , 2001, Ann. Oper. Res..

[16]  Rema Padman,et al.  An integrated survey of deterministic project scheduling , 2001 .

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

[18]  Rainer Kolisch,et al.  Efficient priority rules for the resource-constrained project scheduling problem , 1996 .

[19]  Rainer Kolisch,et al.  Adaptive search for solving hard project scheduling problems , 1996 .

[20]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[21]  Peter Brucker,et al.  A branch and bound algorithm for the resource-constrained project scheduling problem , 1998, Eur. J. Oper. Res..

[22]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

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

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

[25]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[27]  Rainer Kolisch,et al.  Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem , 1995 .

[28]  Arno Sprecher,et al.  Resource-Constrained Project Scheduling: Exact Methods for the Multi-Mode Case , 1994 .

[29]  Sönke Hartmann,et al.  Project scheduling with multiple modes: A comparison of exact algorithms , 1998 .

[30]  Erik Demeulemeester,et al.  A classification scheme for project scheduling , 1999 .

[31]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .

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

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

[34]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[35]  J. H. Patterson,et al.  An Algorithm for a general class of precedence and resource constrained scheduling problems , 1989 .

[36]  Yeong-Dae Kim,et al.  Search Heuristics for Resource Constrained Project Scheduling , 1996 .

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