Developing a new method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources

Article history: Received February 25, 2016 Received in revised format: March 28, 2016 Accepted May 17, 2016 Available online May 19 2016 The issue of resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating is frequently seen after initial scheduling of a project in practice and causes significant amount of efforts to modify the initial schedules. In this research, a new method is developed for modifying over-allocated schedules in a multi-mode resource constrained project scheduling problems (MRCPSPs) with positive cash flows (MRCPSP-PCF). The aim is to maximize profit of the MRCPSPs or logically minimizing costs. The proposed method can be used as a macro in Microsoft Office Project® Software to modify resource over-allocated days after scheduling a project. This research considers progress payment method and preemptive resources. The proposed approach maximizes profit by scheduling activities through the resource calendar respecting to the available level of preemptive resources and activity numbers. To examine the performance of the proposed method a number of experiments derived from the literature are solved. The results are then compared with the circumstances where resource constraints are relaxed. The outcomes show that in all studied cases, the proposed algorithm can provide modified schedules with no over-allocated days. Afterward the method is applied to modify a manufacturing project in practice. Growing Science Ltd. All rights reserved. 6 © 201

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

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

[3]  María Pilar Tormos,et al.  Analysis of Scheduling Schemes and Heuristic Rules Performance in Resource-Constrained Multiproject Scheduling , 2001, Ann. Oper. Res..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[20]  Seyed Taghi Akhavan Niaki,et al.  Bi-objective resource constrained project scheduling problem with makespan and net present value criteria: two meta-heuristic algorithms , 2013 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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