Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.contributor.authorSuárez M.O.
dc.date.accessioned2020-09-02T22:15:39Z
dc.date.available2020-09-02T22:15:39Z
dc.date.issued2014
dc.identifier10.1109/CISTI.2014.6877091
dc.identifier.issn21660727
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4144
dc.descriptionThe 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.isoes
dc.publisherIEEE Computer Society
dc.subjectHypercube
dc.subjectMax-Min Ant System
dc.subjectMetaheuristics
dc.subjectSoftware Project Scheduling
dc.subjectInformation systems
dc.subjectAnt system algorithm
dc.subjectHypercube
dc.subjectMax-Min Ant System
dc.subjectMeta heuristics
dc.subjectPrecedence constraints
dc.subjectProject scheduling problem
dc.subjectSoftware project
dc.subjectSoftware Project Scheduling
dc.subjectScheduling
dc.titleMax-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.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record