.png){kind=icon}
.png){kind=icon}
Return
A random key based genetic algorithm for the resource constrained project scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2007.07.001.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 Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm. (C) 2007 Elsevier Ltd. All rights reserved.
Keywords:
Project management
Scheduling
Genetic algorithms
Random keys
RCPSP
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
View more organizations