Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: a dynamic forward approach

Purpose:  The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach:  In this article, a forward approach for maximizing net present value (NPV) in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF) is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings:  The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value:  The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.

[1]  N. R. Achuthan,et al.  Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm , 2001, Ann. Oper. Res..

[2]  R. Tavakkoli-Moghaddam,et al.  A NEW BI-OBJECTIVE MODEL FOR A MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM WITH DISCOUNTED CASH FLOWS AND FOUR PAYMENT MODELS , 2008 .

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

[4]  R. Leus,et al.  The trade-off between stability and makespan in resource-constrained project scheduling , 2004 .

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

[6]  A. S. Azfanizam,et al.  A Backward Approach for Maximizing Net Present Value of Multimode Pre-emptive Resource-Constrained Project Scheduling Problem with Discounted Cash Flows Using Simulated Annealing Algorithm , 2014, International Journal of Industrial Engineering and Management.

[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]  Bert De Reyck,et al.  A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations , 1998, Eur. J. Oper. Res..

[10]  Ming Zhou,et al.  Formation of general GT cells: an operation-based approach , 1998 .

[11]  Kum Khiong Yang,et al.  Scheduling a project to maximize its net present value: An integer programming approach , 1993 .

[12]  Manuel Castejón Limas,et al.  Effort estimates through project complexity , 2011, Ann. Oper. Res..

[13]  Mohamed Haouari,et al.  A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling , 2008, Comput. Ind. Eng..

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

[15]  Chang Sup Sung,et al.  A project activity scheduling problem with net present value measure , 1994 .

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

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

[18]  A. H. Russell Cash Flows in Networks , 1970 .

[19]  Kin Keung Lai,et al.  Genetic algorithm-based multi-criteria project portfolio selection , 2012, Ann. Oper. Res..

[20]  Rema Padman,et al.  A metaheuristic scheduling procedure for resource‐constrained projects with cash flows , 1999 .

[21]  Baoding Liu,et al.  Fuzzy project scheduling problem and its hybrid intelligent algorithm , 2010 .

[22]  Mohd Khairol Anuar Mohd Ariffin,et al.  Minimizing makespan of a resource-constrained scheduling problem: A hybrid greedy and genetic algorithms , 2015 .

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

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

[25]  Chung-Yee Lee,et al.  Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases , 2001, Ann. Oper. Res..

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

[27]  Salah E. Elmaghraby,et al.  The scheduling of activities to maximize the net present value of projects , 1990 .

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

[29]  S. Selcuk Erenguc,et al.  Project Scheduling Problems: A Survey , 1993 .

[30]  Sami M. Baroum,et al.  An Exact Solution Procedure for Maximizing the Net Present Value of Cash Flows in a Network , 1999 .

[31]  Aidin Delgoshaei,et al.  Developing a new method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources , 2016 .

[32]  A. Shtub,et al.  Scheduling projects to maximize net present value — the case of time-dependent, contingent cash flows , 1997 .

[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]  Rainer Kolisch Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[35]  Jin Ye,et al.  A heuristic project scheduling approach for quick response to maritime disaster rescue , 2009 .

[36]  Mitsuo Gen,et al.  Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling , 2005, Comput. Ind..

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

[40]  Erik Demeulemeester,et al.  The use of buffers in project management: The trade-off between stability and makespan , 2004 .

[41]  S. Selçuk Erengüç,et al.  A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows , 1994, Comput. Oper. Res..

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

[43]  Arno Sprecher,et al.  Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements , 2000 .

[44]  Gündüz Ulusoy,et al.  Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows , 2001, Ann. Oper. Res..

[45]  Zohar Laslo Project portfolio management: An integrated method for resource planning and scheduling to minimize planning/scheduling-dependent expenses , 2010 .