In this paper, we consider genetic algorithm approach for the resource constrained project scheduling problems. Starting with the summarizing the basic components of genetic algorithm approaches, we describe the generating project schemes and its necessities. Subsequently, we present the results of our computational study which is depend on the standart set of test instances. These instances have only four reources and thirty activities. The results are obtained from a computer program that is developed by Delphi 6.0. Moreover, the behaviour of the developed genetic algorithm is analyzed with respect to its main components such as iteration number, crossover rate and priority rules. Finally the influence of the problem characteristics, like that simplicity, complexity and size, is examined on the performance of the genetic algorithm. At the end of the study, the results show that the solutions produced from the developed genetic algorithm is generally near the optimum solution.
Makaleler İngilizce Anahtar Kelimeler:
