A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem

In this paper we present a genetic algorithm for the multi-mode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. We also introduce the preemptive extension of the problem which allows activity splitting (P-MRCPSP). To solve the problem, we apply a bi-population genetic algorithm, which makes use of two separate populations and extend the serial schedule generation scheme by introducing a mode improvement procedure. We evaluate the impact of preemption on the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that our procedure is amongst the most competitive algorithms.

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

[2]  Roman Słowiński,et al.  DSS for multiobjective project scheduling , 1994 .

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

[4]  David D. Bedworth,et al.  Integrated Production, Control Systems: Management, Analysis, and Design , 1982 .

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

[6]  Toshihide Ibaraki,et al.  Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem , 2002 .

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

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

[9]  Mario Vanhoucke,et al.  A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem , 2007, Oper. Res..

[10]  María Pilar Tormos,et al.  A Competitive Heuristic Solution Technique for Resource-Constrained Project Scheduling , 2001, Ann. Oper. Res..

[11]  Heng Li,et al.  Multimode Project Scheduling Based on Particle Swarm Optimization , 2006, Comput. Aided Civ. Infrastructure Eng..

[12]  Gang Yu,et al.  A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem , 2006, INFORMS J. Comput..

[13]  Pilar Tormos,et al.  Project Management: an Evaluation of Software Quality , 1994 .

[14]  Roman Słowiński,et al.  Two Approaches to Problems of Resource Allocation Among Project Activities — A Comparative Study , 1980 .

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

[16]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

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

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

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

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

[21]  Bert De Reyck,et al.  A hybrid scatter search/electromagnetism meta-heuristic for project scheduling , 2006, Eur. J. Oper. Res..

[22]  Arno Sprecher,et al.  A note on “hierarchical models for multi-project planning and scheduling” , 1996 .

[23]  Arno Sprecher,et al.  Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation , 1996 .

[24]  Grzegorz Waligóra,et al.  Project scheduling with finite or infinite number of activity processing modes - A survey , 2011, Eur. J. Oper. Res..

[25]  Mohammad Ranjbar,et al.  A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling , 2009, Eur. J. Oper. Res..

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

[27]  Sacramento Quintanilla,et al.  Project Scheduling with Stochastic Activity Interruptions , 1999 .

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

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

[30]  Moshe Dror,et al.  Agent-based project scheduling , 2000 .

[31]  Erik Demeulemeester,et al.  An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem , 1996 .

[32]  Francisco Ballestín,et al.  Pre-emption in resource-constrained project scheduling , 2008, Eur. J. Oper. Res..

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

[34]  Mario Vanhoucke,et al.  Vlerick Leuven Gent Working Paper Series 2006/15 the Impact of Various Activity Assumptions on the Lead-time and Resource Utilization of Resource-constrained Projects the Impact of Various Activity Assumptions on the Lead-time and Resource Utilization of Resource-constrained Projects Vlerick Leuven , 2022 .

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

[36]  Federico Barber,et al.  An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes , 2009 .

[37]  Jirachai Buddhakulsomsiri,et al.  Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting , 2006, Eur. J. Oper. Res..

[38]  Robert J Willis,et al.  An iterative scheduling technique for resource-constrained project scheduling , 1992 .

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

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

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

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

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

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

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

[46]  Bassem Jarboui,et al.  A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems , 2008, Appl. Math. Comput..

[47]  Federico Barber,et al.  Multi-mode resource constrained project scheduling: scheduling schemes, priority rules and mode selection rules , 2006, Inteligencia Artif..

[48]  Carlo Vercellis,et al.  Hierarchical models for multi-project planning and scheduling , 1993 .

[49]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[50]  Francisco Ballestín,et al.  A hybrid genetic algorithm for the resource-constrained project scheduling problem , 2008, Eur. J. Oper. Res..

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

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

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

[54]  Arno Sprecher,et al.  Manuskripte Aus Den Instituten F Ur Betriebswirtschaftslehre Der Universit at Kiel Solving Multi-mode Resource-constrained Project Scheduling Problems by a Simple, General and Powerful Sequencing Algorithm. Part Ii: Computation , 1996 .

[55]  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..

[56]  Mario Vanhoucke,et al.  A Bi-population Based Genetic Algorithm for the Resource-Constrained Project Scheduling Problem , 2005, ICCSA.

[57]  Mario Vanhoucke,et al.  An evaluation of the adequacy of project network generators with systematically sampled networks , 2008, Eur. J. Oper. Res..

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

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

[60]  Eric Sanlaville,et al.  Linear programming based algorithms for preemptive and non-preemptive RCPSP , 2007, Eur. J. Oper. Res..

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

[62]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

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