The use of metaheuristics to software project scheduling problem

Broderick Crawford, Ricardo Soto, Franklin Johnson, Sanjay Misra, Fernando Paredes

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

6 Citas (Scopus)

Resumen

This paper provides an overview of Software Project Scheduling problem as a combinatorial optimization problem. Since its inception by Alba, there have been multiple models to solve this problem. Metaheuristics provide high-level strategies capable of solving these problems efficiently. A set of metaheuristics used to solve this problem is presented, showing the resolution structure and its application. Among these we can find Simulated Annealing, Variable Neighborhood Search, Genetic Algorithms, and Ant Colony Optimization.

Idioma originalInglés
Título de la publicación alojadaComputational Science and Its Applications, ICCSA 2014 - 14th International Conference, Proceedings
EditorialSpringer Verlag
Páginas215-226
Número de páginas12
EdiciónPART 5
ISBN (versión impresa)9783319091556
DOI
EstadoPublicada - 2014
Publicado de forma externa
Evento14th International Conference on Computational Science and Its Applications, ICCSA 2014 - Guimaraes, Portugal
Duración: 30 jun. 20143 jul. 2014

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NúmeroPART 5
Volumen8583 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia14th International Conference on Computational Science and Its Applications, ICCSA 2014
País/TerritorioPortugal
CiudadGuimaraes
Período30/06/143/07/14

Huella

Profundice en los temas de investigación de 'The use of metaheuristics to software project scheduling problem'. En conjunto forman una huella única.

Citar esto