A solution procedure for preemptive multi-mode project scheduling problem with mode changeability to resumption

Abstract Extensive research has been devoted to the multi-mode resource constrained project scheduling problem (MRCPSP). However, little attention has been paid to problems where preemption is allowed. This paper involves the preemptive multi-mode resource constrained project scheduling problem (P-MRCPSP) to minimize the project makespan subject to mode changeability after preemption. This problem is a more realistic model and extended case of multi-mode resource constrained project scheduling problem. A binary integer programing formulation is proposed for the problem. The problem formed in this way is an NP-hard one forcing us to use the Simulated Annealing (SA) algorithm to obtain a global optimum solution or at least a satisfying one. The performance of the proposed algorithm is evaluated on 480 test problems by statistically comparing in term of the objective function and computational times. The obtained computational results indicate that the proposed algorithm is efficient and effective. Also, it is concluded from the results that mode change is very effective to improve the optimal makespan of the project.

[1]  Behrouz Afshar-Nadjafi,et al.  A genetic algorithm for mode identity and the resource constrained project scheduling problem , 2012 .

[2]  Amir Abbas Najafi,et al.  A multi-mode resource-constrained discrete time–cost tradeoff problem solving using an adjusted fuzzy dominance genetic algorithm , 2013 .

[3]  Mario Vanhoucke,et al.  A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

[4]  Christos D. Tarantilis,et al.  Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm , 2012, Expert Syst. Appl..

[5]  Jairo R. Montoya-Torres,et al.  Project scheduling with limited resources using a genetic algorithm , 2010 .

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

[7]  Shahram Shadrokh,et al.  Bi-objective resource-constrained project scheduling with robustness and makespan criteria , 2006, Appl. Math. Comput..

[8]  Sönke Hartmann,et al.  A survey of variants and extensions of the resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

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

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

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

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

[13]  Mario Vanhoucke,et al.  Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers , 2011, Eur. J. Oper. Res..

[14]  Genichi Taguchi,et al.  Introduction to quality engineering.... , 2014 .

[15]  Oumar Koné New approaches for solving the resource-constrained project scheduling problem , 2013, 4OR.

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

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

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

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

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

[21]  Behrouz Afshar-Nadjafi,et al.  Using meta-heuristics for project scheduling under mode identity constraints , 2013, Appl. Soft Comput..

[22]  R. Kolisch,et al.  Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis , 1998 .

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

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

[25]  Yu Xu,et al.  Simulated annealing and tabu search for multi-mode project payment scheduling , 2009, Eur. J. Oper. Res..

[26]  James H. Patterson,et al.  ProGen/pix - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions , 2000, Eur. J. Oper. Res..

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

[28]  Arno Sprecher Resource-Constrained Project Scheduling , 1994 .

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

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

[31]  A. Drexl,et al.  Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple , General and Powerful Sequeacing Algorithm . Part I : Theory , 2018 .

[32]  John J. DeMatteis An Economic Lot-Sizing Technique I: The Part-Period Algorithm , 1968, IBM Syst. J..

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

[34]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[35]  Anurag Agarwal,et al.  A Neurogenetic approach for the resource-constrained project scheduling problem , 2011, Comput. Oper. Res..

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

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

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

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

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

[41]  Mohammad Ranjbar An Optimal NPV Project Scheduling with Fixed Work Content and Payment on Milestones , 2011 .

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

[43]  Hong Zhang,et al.  Particle swarm optimization for resource-constrained project scheduling , 2006 .

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

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

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

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

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

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

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

[51]  Chen Fang,et al.  An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem , 2012, Comput. Oper. Res..

[52]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

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