The use of metaheuristics to software project scheduling problem
MetadataShow full item record
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. © 2014 Springer International Publishing.
Showing items related by title, author, creator and subject.
Conference PaperCrawford B.; Soto R.; Johnson F.; Vargas M.; Misra S.; Paredes F. (Springer Verlag, 2015)
Conference PaperCrawford B.; Soto R.; Johnson F.; Misra S.; Olguín E. (Springer Verlag, 2016)
Conference PaperCrawford B.; Soto R.; Johnson F.; Valencia C.; Paredes F. (Springer Verlag, 2016)