.png){kind=icon}
.png){kind=icon}
Return
A genetic algorithm for the resource constrained multi-project scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.06.074.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2007 Published by Elsevier B.V.
Keywords:
project management
metaheuristics
genetic algorithm
scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
View more organizations