Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorJohnson F.
dc.contributor.authorMonfroy E.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:39Z
dc.date.available2020-09-02T22:15:39Z
dc.date.issued2014
dc.identifier10.1016/j.eswa.2014.05.003
dc.identifier.citation41, 15, 6634-6645
dc.identifier.issn09574174
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4140
dc.descriptionThe 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.
dc.language.isoen
dc.publisherElsevier Ltd
dc.subjectAnt Colony Optimization
dc.subjectProject management
dc.subjectSoftware engineering
dc.subjectSoftware Project Scheduling Problem
dc.subjectAlgorithms
dc.subjectAnt colony optimization
dc.subjectManagement science
dc.subjectProject management
dc.subjectSoftware engineering
dc.subjectMax-Min Ant System
dc.subjectProject scheduling problem
dc.subjectSoftware project
dc.subjectSoftware Project Scheduling
dc.subjectScheduling
dc.titleA Max-Min Ant System algorithm to solve the Software Project Scheduling Problem
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record