Genetic Algorithms for Leveling Reswource Usage Problem in Resource-Constrained Project Scheduling

摘要

In this paper, we present genetic algorithm for solving leveling multi-types resource usage problems in multiple resource constrained project scheduling. The objective is to determine the starting time for the activities of a project satisfying precedence and resource constraints in order to level resource usage. In this paper, Nonlinear integer programming model has been established. Monte Carlo method (MCM) is compared with genetic algorithms (GAs) in solving this model. Numerical examples show that genetic algorithms perform well for resource-constrained project scheduling problem (RCPSP).