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]

Crawford B.; Soto R.; Johnson F.; Paredes F.; Suárez M.O.

dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Johnson F.
dc.contributor.author	Paredes F.
dc.contributor.author	Suárez M.O.
dc.date.accessioned	2020-09-02T22:15:39Z
dc.date.available	2020-09-02T22:15:39Z
dc.date.issued	2014
dc.identifier	10.1109/CISTI.2014.6877091
dc.identifier.issn	21660727
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4144
dc.description	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.
dc.language.iso	es
dc.publisher	IEEE Computer Society
dc.subject	Hypercube
dc.subject	Max-Min Ant System
dc.subject	Metaheuristics
dc.subject	Software Project Scheduling
dc.subject	Information systems
dc.subject	Ant system algorithm
dc.subject	Hypercube
dc.subject	Max-Min Ant System
dc.subject	Meta heuristics
dc.subject	Precedence constraints
dc.subject	Project scheduling problem
dc.subject	Software project
dc.subject	Software Project Scheduling
dc.subject	Scheduling
dc.title	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]
dc.type	Conference Paper

Ficheros en el ítem

Nombre:: item_2-s2.0-84906691241.pdf
Tamaño:: 2.373Kb
Formato:: PDF

Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Artículos científicos

Mostrar el registro sencillo del ítem

Repositorio Académico

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]

Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Ítems relacionados

Firefly algorithm to solve a project scheduling problem (2020) ﻿

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) ﻿

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) ﻿

Firefly algorithm to solve a project scheduling problem (2020)

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)

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)