Max-Min Ant System to solve the software project scheduling problem [Sistemas de Hormigas Max-Min para resolver el Problema de Programación de Proyectos de Software]
Autor
Crawford B.
Soto R.
Johnson F.
Paredes F.
Suárez M.O.
Resumen
The Software Project Scheduling Problem is a special case of project scheduling problems. This problem consists in assigning workers with different skills, to a series of tasks in a software project so that the project is completed in the shortest time and the lowest cost possible. In addition, this allocation must meet the constraints of skill required for each task and the precedence constraints between tasks. The solution to this problem is presented using the Max - Min Ant System algorithm and the Hypercube framework. Two heuristics capable of guiding the algorithm to find better solutions are proposed. Experimental results are presented and compared with other techniques of resolution, showing an improvement by implementing our proposal. © 2014 AISTI.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Firefly algorithm to solve a project scheduling problem (2020)
Crawford B.; Soto R.; Johnson F.; Valencia C.; Paredes F. (Springer Verlag, 2016) -
Conference Paper
Using binary fruit fly algorithm for solving the set covering problem [Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura] (2020)
Crawford B.; Soto R.; Torres-Rojas C.; Peña C.; Riquelme-Leiva M.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015) -
Conference Paper
Enumeration strategies to solve constraint satisfaction problems: Performance evaluation [Estrategias de Enumeración para Resolver Problemas de Satisfacción de Restricciones: Evaluación de desempeño] (2020)
Soto R.; Crawford B.; Olivares R.; Herrera R.; Johnson F.; Paredes F. (Institute of Electrical and Electronics Engineers Inc., 2015)