CBO and CSS Algorithms for Resource Allocation and Time-Cost Trade-Off

Resource allocation project scheduling problem (RCPSP) has been one of the challenging subjects among researchers in the last decades. Though several methods have been adopted to solve this problem, however, new metahuristics are available to solve this problem for finding better solution with less computational time. In this paper two new metahuristic algorithms are applied for solving this problem known as charged system search (CSS) and colliding body optimization (CBO). The results show that both of these algorithms find reasonable solutions, however CBO could find the result in a less computational time having a better quality. Two case studies are conducted to evaluate the performance and applicability of the proposed algorithms.

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

[2]  Ali Kaveh,et al.  Colliding Bodies Optimization method for optimum discrete design of truss structures , 2014 .

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

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

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

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

[7]  A. Kaveh,et al.  A novel heuristic optimization method: charged system search , 2010 .

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

[9]  Ali Kaveh,et al.  Advances in Metaheuristic Algorithms for Optimal Design of Structures , 2014 .

[10]  Wang Cheng-en,et al.  A multi-mode resource-constrained discrete time–cost tradeoff problem and its genetic algorithm based solution , 2009 .

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

[12]  V. Toğan,et al.  Optimization of 3d trusses with adaptive approach in genetic algorithms , 2006 .

[13]  Rema Padman,et al.  An integrated survey of deterministic project scheduling , 2001 .

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

[15]  John F. Muth,et al.  A Dynamic Programming Algorithm for Decision CPM Networks , 1979, Oper. Res..

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

[17]  Po-Han Chen,et al.  A two-phase GA model for resource-constrained project scheduling , 2009 .

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

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

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

[21]  Liu Shi.  Genetic Algorithm for the Discrete Time/Cost Trade-off Problem in Project Networks , 2000 .

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

[23]  Xu Yu,et al.  Discrete Time/Cost Trade-offs in Project Scheduling with Time-switch Constraints , 2006 .