Mostrar el registro sencillo del ítem
Ants can schedule software projects
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Johnson F. | |
dc.contributor.author | Monfroy E. | |
dc.date.accessioned | 2020-09-02T22:15:38Z | |
dc.date.available | 2020-09-02T22:15:38Z | |
dc.date.issued | 2013 | |
dc.identifier | 10.1007/978-3-642-39473-7_126 | |
dc.identifier.citation | 373, PART I, 635-639 | |
dc.identifier.issn | 18650929 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4138 | |
dc.description | This paper presents the design of an algorithm based on Ant Colony Optimization paradigm to solve the Software Project Scheduling Problem. This problem consists in deciding who does what during the software project development, finding an optimal schedule for a project so that the precedence and resource constraints are satisfied and the final project cost and its duration are minimized. We present the design of an general ant algorithm to solve it. © Springer-Verlag Berlin Heidelberg 2013. | |
dc.language.iso | en | |
dc.publisher | Springer Verlag | |
dc.subject | Ant colony optimization | |
dc.subject | Project management | |
dc.subject | Software engineering | |
dc.subject | Software project scheduling problem | |
dc.subject | Ant colony optimization | |
dc.subject | Artificial intelligence | |
dc.subject | Project management | |
dc.subject | Scheduling | |
dc.subject | Software engineering | |
dc.subject | Ant algorithms | |
dc.subject | Optimal schedule | |
dc.subject | Project cost | |
dc.subject | Resource Constraint | |
dc.subject | Software project | |
dc.subject | Software Project Scheduling | |
dc.subject | Algorithms | |
dc.title | Ants can schedule software projects | |
dc.type | Conference Paper |