Project Scheduling Using Genetic Algorithms

In project scheduling, the activity precedence constraint was transformed into a relation matrix. The initialization group was created randomly from a executable activity set, an improving two-point crossover algorithm was used. And proposed a neighborhood locus mutation based on a dependence matrix, which avoids the appearance of illegal individuals. To prove its good performance, an example with three resources constraint is illustrated.