Using Artificial Bee Colony to Solve Stochastic Resource Constrained Project Scheduling Problem

Resource constrained project scheduling (RCPSP) is one of the most crucial problems in project problem. The aim of RCPSP, which is NP-hard, is to minimize the project duration. Sometimes the activity durations are not known in advance and are random variables. These problems are called stochastic resource constrained project scheduling problems or stochastic RCPSP. Various algorithms such as genetic algorithm and GRASP have been applied on stochastic RCPSP. Bee algorithm is a metaheuristic based on the intelligent behavior of honey bee swarms. The goal of this study is adopting the artificial bee colony (ABC) algorithm to solve stochastic RCPSP and investigating its performance on the stochastic RCPSP. Simulation results show that proposed algorithm is an effective method for solving the stochastic resource constrained project scheduling problem. With regard to the problems with high distribution variability, the ABC algorithm is more effective than the other algorithms in the literature.

[1]  Douglas D. Gemmill,et al.  Using tabu search to schedule activities of stochastic resource-constrained projects , 1998, Eur. J. Oper. Res..

[2]  R. Wollmer.  Critical path planning under uncertainty , 1985 .

[3]  Franz Josef Radermacher,et al.  Preselective strategies for the optimization of stochastic project networks under resource constraints , 1983, Networks.

[4]  Frederik Stork,et al.  Stochastic resource-constrained project scheduling , 2001 .

[5]  Roel Leus,et al.  Resource‐Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations , 2007 .

[6]  Christine Strauss,et al.  A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management , 2000, INFORMS J. Comput..

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

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

[9]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[10]  Yigal Gerchak,et al.  On the allocation of uncertainty-reduction effort to minimize total variability , 2000 .

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

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

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

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

[15]  Francisco Ballestín,et al.  When it is worthwhile to work with the stochastic RCPSP? , 2007, J. Sched..

[16]  Reza Akbari,et al.  Artificial Bee colony for resource constrained project scheduling problem , 2011 .

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

[18]  Seyed Mohammad Moattar Husseini,et al.  An inventory model with dependent returns and disposal cost , 2010 .

[19]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[20]  Dimitri Golenko-Ginzburg,et al.  Stochastic network project scheduling with non-consumable limited resources , 1997 .