Title
A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem
Date Issued
01 November 2014
Access level
metadata only access
Resource Type
journal article
Author(s)
Crawford B.
Johnson F.
Monfroy E.
Paredes F.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Elsevier Ltd
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. © 2014 Elsevier Ltd. All rights reserved.
Start page
6634
End page
6645
Volume
41
Issue
15
Language
English
OCDE Knowledge area
Ingeniería de sistemas y comunicaciones Ciencias de la computación
Scopus EID
2-s2.0-84902979895
Source
Expert Systems with Applications
ISSN of the container
09574174
Sources of information: Directorio de Producción Científica Scopus