A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem
Abstract
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. (C) 2014 Elsevier Ltd. All rights reserved.
Más información
Título según WOS: | A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem |
Título según SCOPUS: | A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem |
Título de la Revista: | EXPERT SYSTEMS WITH APPLICATIONS |
Volumen: | 41 |
Número: | 15 |
Editorial: | PERGAMON-ELSEVIER SCIENCE LTD |
Fecha de publicación: | 2014 |
Página de inicio: | 6634 |
Página final: | 6645 |
Idioma: | English |
DOI: |
10.1016/j.eswa.2014.05.003 |
Notas: | ISI, SCOPUS |