A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem
Autor
Crawford B.
Soto R.
Johnson F.
Monfroy E.
Paredes F.
Resumen
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. © 2014 Elsevier Ltd. All rights reserved.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
A new approach to solve the software project scheduling problem based on max–min ant system (2020)
Crawford B.; Soto R.; Johnson F.; Monfroy E.; Paredes F. (Springer Verlag, 2014) -
Conference Paper
Ants can schedule software projects (2020)
Crawford B.; Soto R.; Johnson F.; Monfroy E. (Springer Verlag, 2013) -
Conference Paper
A scheduling problem for software project solved with ABC metaheuristic (2020)
Crawford B.; Soto R.; Johnson F.; Vargas M.; Misra S.; Paredes F. (Springer Verlag, 2015)