Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akbari, R., Zeighami, V., Ziarati, K.: Artificial Bee colony for resource constrained project scheduling problem. International Journal of Industrial Engineering Computations 1, 45–60 (2011)
Ballestin, F.: When it is worthwhile to work with the stochastic RCPSP? Journal of Scheduling 10, 153–166 (2007)
Ballestin, F., Leus, R.: Resource-constrained project scheduling for timely project completion with stochastic activity durations. Production and Operations Management 18, 459–474 (2009)
Blazewicz, J., Lenstra, J., Rinnooy Kan, A.: Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics 5, 11–24 (1983)
Gerchak, Y.: On the allocation of uncertainty-reduction effort to minimize total variability. IIE Transactions 32, 403–407 (2000)
Golenko-Ginzburg, D., Gonik, D.: Stochastic network project scheduling with non-consumable limited resources. International Journal of Production Economics 48, 29–37 (1997)
Gutjahr, W.J., Straus, C., Wagner, E.: A stochastic branch-and-bound approach to activity crashing in project management. INFORMS Journal on Computing 12, 125–135 (2000)
Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research 127, 394–407 (2000)
Igelmund, G., Radermacher, F.J.: Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks 13, 1–28 (1983)
Karaboga, D.: An Idea Based On Honey Bee Swarm For Numerical Optimization, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39, 459–471 (2007)
Kolisch, R., Hartmann, S.: Heuristic Algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Handbook of Recent Advances in Project Scheduling, pp. 147–178. Kluwer Academic Publishers, Boston
Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling problem library. European Journal of Operational Research 96, 205–216 (1996)
Stork F.: Stochastic resource-constrained project scheduling, Ph.D. thesis, Technische UniversitÄat Berlin, (2001)
Tsai, Y.-W., Gemmill, D.D.: Using tabu search to schedule activities of stochastic resource-constrained projects. European Journal of Operational Research 111, 129–141 (1998)
Valls, V., Ballestın, F., Quintanilla, S.: A hybrid genetic algorithm for the resource constrained project scheduling problem. European Journal of Operational Research 185, 495–508 (2008)
Wollmer, R.D.: Critical path planning under uncertainty. Mathematical Programming Study 25, 164–171 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tahooneh, A., Ziarati, K. (2011). Using Artificial Bee Colony to Solve Stochastic Resource Constrained Project Scheduling Problem. In: Tan, Y., Shi, Y., Chai, Y., Wang, G. (eds) Advances in Swarm Intelligence. ICSI 2011. Lecture Notes in Computer Science, vol 6728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21515-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-21515-5_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21514-8
Online ISBN: 978-3-642-21515-5
eBook Packages: Computer ScienceComputer Science (R0)