TY - JOUR
T1 - A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem
AU - CRAWFORD LABRIN, BRODERICK
AU - SOTO DE GIORGIS, RICARDO JAVIER
AU - Johnson, Franklin
AU - Monfroy, Eric
AU - Paredes, Fernando
PY - 2014/11/1
Y1 - 2014/11/1
N2 - The Software Project Scheduling Problem is a specific Project Scheduling Problem present in many industrial and academic areas. This problem consists in making the appropriate worker-task assignment in a software project so the cost and duration of the project are minimized. We present the design of a Max-Min Ant System algorithm using the Hyper-Cube framework to solve it. This framework improves the performance of the algorithm. We illustrate experimental results and compare with other techniques demonstrating the feasibility and robustness of the approach, while reaching competitive solutions.
AB - The Software Project Scheduling Problem is a specific Project Scheduling Problem present in many industrial and academic areas. This problem consists in making the appropriate worker-task assignment in a software project so the cost and duration of the project are minimized. We present the design of a Max-Min Ant System algorithm using the Hyper-Cube framework to solve it. This framework improves the performance of the algorithm. We illustrate experimental results and compare with other techniques demonstrating the feasibility and robustness of the approach, while reaching competitive solutions.
KW - Ant Colony Optimization
KW - Project management
KW - Software engineering
KW - Software Project Scheduling Problem
UR - http://www.scopus.com/inward/record.url?scp=84902979895&partnerID=8YFLogxK
U2 - 10.1016/j.eswa.2014.05.003
DO - 10.1016/j.eswa.2014.05.003
M3 - Article
AN - SCOPUS:84902979895
VL - 41
SP - 6634
EP - 6645
JO - Expert Systems with Applications
JF - Expert Systems with Applications
SN - 0957-4174
IS - 15
ER -