A robust genetic algorithm for resource allocation in project scheduling

Citation
J. Alcaraz et C. Maroto, A robust genetic algorithm for resource allocation in project scheduling, ANN OPER R, 102, 2001, pp. 83-109
Citations number
88
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Engineering Mathematics
Journal title
ANNALS OF OPERATIONS RESEARCH
ISSN journal
0254-5330 → ACNP
Volume
102
Year of publication
2001
Pages
83 - 109
Database
ISI
SICI code
0254-5330(2001)102:<83:ARGAFR>2.0.ZU;2-G
Abstract
Genetic algorithms have been applied to many different optimization problem s and they are one of the most promising metaheuristics. However, there are few published studies concerning the design of efficient genetic algorithm s for resource allocation in project scheduling. In this work we present a robust genetic algorithm for the single-mode resource constrained project s cheduling problem. We propose a new representation for the solutions, based on the standard activity list representation and develop new crossover tec hniques with good performance in a wide sample of projects. Through an exte nsive computational experiment, using standard sets of project instances, w e evaluate our genetic algorithm and demonstrate that our approach outperfo rms the best algorithms appearing in the literature.