A Robust Genetic Algorithm for Resource Allocation in Project Scheduling
J. Alcaraz () and
C. Maroto ()
Annals of Operations Research, 2001, vol. 102, issue 1, 83-109
Genetic algorithms have been applied to many different optimization problems and they are one of the most promising metaheuristics. However, there are few published studies concerning the design of efficient genetic algorithms for resource allocation in project scheduling. In this work we present a robust genetic algorithm for the single-mode resource constrained project scheduling problem. We propose a new representation for the solutions, based on the standard activity list representation and develop new crossover techniques with good performance in a wide sample of projects. Through an extensive computational experiment, using standard sets of project instances, we evaluate our genetic algorithm and demonstrate that our approach outperforms the best algorithms appearing in the literature. Copyright Kluwer Academic Publishers 2001
Keywords: genetic algorithms; resource-constrained project scheduling; project management; heuristic and metaheuristic techniques; computational experiment (search for similar items in EconPapers)
References: Add references at CitEc
Citations: View citations in EconPapers (29) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:102:y:2001:i:1:p:83-109:10.1023/a:1010949931021
Ordering information: This journal article can be ordered from
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla ().