Mostrar el registro sencillo del ítem
A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Johnson F. | |
dc.contributor.author | Monfroy E. | |
dc.contributor.author | Paredes F. | |
dc.date.accessioned | 2020-09-02T22:15:39Z | |
dc.date.available | 2020-09-02T22:15:39Z | |
dc.date.issued | 2014 | |
dc.identifier | 10.1016/j.eswa.2014.05.003 | |
dc.identifier.citation | 41, 15, 6634-6645 | |
dc.identifier.issn | 09574174 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4140 | |
dc.description | 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. | |
dc.language.iso | en | |
dc.publisher | Elsevier Ltd | |
dc.subject | Ant Colony Optimization | |
dc.subject | Project management | |
dc.subject | Software engineering | |
dc.subject | Software Project Scheduling Problem | |
dc.subject | Algorithms | |
dc.subject | Ant colony optimization | |
dc.subject | Management science | |
dc.subject | Project management | |
dc.subject | Software engineering | |
dc.subject | Max-Min Ant System | |
dc.subject | Project scheduling problem | |
dc.subject | Software project | |
dc.subject | Software Project Scheduling | |
dc.subject | Scheduling | |
dc.title | A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem | |
dc.type | Article |