The use of metaheuristics to software project scheduling problem

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Franklin Johnson, Sanjay Misra, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationComputational Science and Its Applications, ICCSA 2014 - 14th International Conference, Proceedings
PublisherSpringer Verlag
Pages215-226
Number of pages12
EditionPART 5
ISBN (Print)9783319091556
DOIs
StatePublished - 1 Jan 2014
Event14th International Conference on Computational Science and Its Applications, ICCSA 2014 - Guimaraes, Portugal
Duration: 30 Jun 20143 Jul 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 5
Volume8583 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Computational Science and Its Applications, ICCSA 2014
Country/TerritoryPortugal
CityGuimaraes
Period30/06/143/07/14

Keywords

  • Metaheuristcs
  • Optimization
  • Software Project Scheduling

Fingerprint

Dive into the research topics of 'The use of metaheuristics to software project scheduling problem'. Together they form a unique fingerprint.

Cite this