| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 112.55 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial
optimization for which extensive investigation has been devoted to the development of efficient algorithms.
During the last couple of years many heuristic procedures have been developed for this problem, but still these
procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource
constrained project scheduling problem. The chromosome representation of the problem is based on random
keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the
activities are defined by the genetic algorithm. 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
Description
Keywords
Project management Scheduling Genetic algorithm Optimization RCPSP
Citation
Publisher
World Scientific and Engineering Academy and Society (WSEAS)