Abstract | ||
---|---|---|
This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.ejor.2006.06.074 | European Journal of Operational Research |
Keywords | Field | DocType |
Project management,Metaheuristics,Genetic algorithm,Scheduling | Heuristic,Parameterized complexity,Mathematical optimization,Job shop scheduling,Computer science,Scheduling (computing),Schedule,Population-based incremental learning,Genetic algorithm,Operations management,Metaheuristic | Journal |
Volume | Issue | ISSN |
189 | 3 | 0377-2217 |
Citations | PageRank | References |
82 | 3.29 | 11 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
José Fernando Gonçalves | 1 | 736 | 37.31 |
Jorge José De Magalhães Mendes | 2 | 265 | 11.18 |
Mauricio G. C. Resende | 3 | 3729 | 336.98 |