Mostrar el registro sencillo del ítem
A new approach to solve the software project scheduling problem based on max–min ant system
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.1007/978-3-319-06740-7_4 | |
dc.identifier.citation | 285, , 41-51 | |
dc.identifier.issn | 21945357 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4141 | |
dc.description | This paper presents a new approach to solve the Software Project Scheduling Problem. This problem is NP-hard and consists in finding a workertask schedule that minimizes cost and duration for the whole project, so that task precedence and resource constraints are satisfied. Such a problem is solved with an Ant Colony Optimization algorithm by using the Max–Min Ant System and the Hyper-Cube framework. We illustrate experimental results and compare with other techniques demonstrating the feasibility and robustness of the approach, while reaching competitive solutions. © Springer International Publishing Switzerland 2014. | |
dc.language.iso | en | |
dc.publisher | Springer Verlag | |
dc.source | Silhavy R.Senkerik R.Oplatkova Z.K.Silhavy P.Prokopova Z. | |
dc.subject | Ant colony optimization | |
dc.subject | Max–Min ant system | |
dc.subject | Project management | |
dc.subject | Software engineering | |
dc.subject | Software project scheduling problem | |
dc.subject | Algorithms | |
dc.subject | Ant colony optimization | |
dc.subject | Artificial intelligence | |
dc.subject | Computer software | |
dc.subject | Optimization | |
dc.subject | Project management | |
dc.subject | Social networking (online) | |
dc.subject | Software engineering | |
dc.subject | Ant Colony Optimization algorithms | |
dc.subject | Ant systems | |
dc.subject | Hyper-cubes | |
dc.subject | New approaches | |
dc.subject | NP-hard | |
dc.subject | Resource Constraint | |
dc.subject | Software Project Scheduling | |
dc.subject | Scheduling | |
dc.title | A new approach to solve the software project scheduling problem based on max–min ant system | |
dc.type | Conference Paper |