A competitive genetic algorithm for resource-constrained project scheduling

This paper considers the resource-constrained project scheduling problem (RCPSP) with makespan minimization as objective and proposes a new genetic algorithm approach to solve this problem that makes use of a permutation based genetic encoding that contains problem-specific knowledge.