Solving software project scheduling problem using grey wolf optimization

Marrwa Abd-AlKareem Alabajee, Dena Rafaa Ahmed, Taghreed Riyadh Alreffaee


In this paper, we will explore the application of grey wolf optimization (GWO) methodology in order to solve the software project scheduling problem (SPSP) to seek an optimum solution via applying different instances from two datasets. We will focus on the effects of the quantity of employees as well as the number of tasks which will be accomplished. We concluded that increasing employee number will decrease the project’s duration, but we could not find any explanation for the cost values for all instances that studied. Also, we concluded that, when increasing the number of the tasks, both the cost and duration will be increased. The results will compare with a max-min ant system hyper cube framework (MMAS-HC), intelligent water drops algorithm (IWD), firefly algorithm (FA), ant colony optimization (ACO), intelligent water drop algorithm standard version (IWDSTD), and intelligent water drop autonomous search (IWDAS). According to these study and comparisons, we would like to say that GWO algorithm is a better optimizing tool for all instances, except one instance that FA is outperform the GWO.


grey wolf optimization; resource-constrained project scheduling; software project management; software project scheduling problem;

Full Text:



Article Metrics

Abstract view : 0 times
PDF - 0 times


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120
Fax: +62 274 564604