Looking for the best modes helps solving the MRCPSP/max

The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags MRCPSP/max is a very general project scheduling problem with multiple execution modes per activity, renewable and non-renewable resources and minimum and maximum time lags between activities. In this paper, we describe SA-EVA, an algorithm for the problem. SA-EVA first searches for the best mode for each activity, without considering renewable resources. In this phase a simulated annealing is applied. Once a mode vector has been chosen, the problem reduces to the RCPSP/max, which SA-EVA solves with EVA, an algorithm designed in Ballestín et al. [2009. An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time-lags. Journal of Scheduling, 14 (4), online]. Computational results show that SA-EVA outperforms the state-of-the-art algorithms in medium and large instances.

[1]  Stephen F. Smith,et al.  A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.

[2]  Prabuddha De,et al.  Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks , 1997, Oper. Res..

[3]  Rubén Ruiz,et al.  Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms , 2003, J. Oper. Res. Soc..

[4]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[5]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[6]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

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

[8]  Francisco Ballestín,et al.  Justification and RCPSP: A technique that pays , 2005, Eur. J. Oper. Res..

[9]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[10]  Francisco Ballestín,et al.  An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags , 2011, J. Sched..

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

[12]  Grzegorz Waligóra,et al.  Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling , 2001, Ann. Oper. Res..

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

[14]  Francisco Ballestín,et al.  A double genetic algorithm for the MRCPSP/max , 2011, Comput. Oper. Res..

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

[16]  Roland Heilmann.  Resource–constrained project scheduling: a heuristic for the multi–mode case , 2001, OR Spectr..

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

[18]  Bert De Reyck,et al.  The multi-mode resource-constrained project scheduling problem with generalized precedence relations , 1999, Eur. J. Oper. Res..

[19]  Rolf H. Möhring,et al.  Scheduling project networks with resource constraints and time windows , 1988 .

[20]  Roland Heilmann,et al.  Discrete Optimization A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags , 2002 .

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[22]  U. Dorndorf,et al.  A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints , 2000 .