Research of Multi-Mode Resource-Constrained Project Scheduling Problem Based on Genetic Algorithm
基于遗传算法的多模式资源约束项目调度问题研究

This paper developes a hybrid genetic algorithm for solving Multi-Mode Resource-Constrained Project Scheduling Problem(MRCPSP).The objective is to determine a mode and a start time for each activity such that all constraints are observed and the project duration is minimized.A two-dimensional encoding is used in the algorithm.Each gene represents the priority and execution mode of an activity.A feasible activity sort meeting precedence constraints can be generated from a given chromosome.It can construct a scheduling meeting resource constraints by selecting the activities and their execution mode in order of their appearance in the activity sort.Using the encoding the algorithm can get all possible schedulings through genetic operators: selection,crossover,mutation.Results show that the algorithm can get near-optimal solutions of MRCPSP rapidly.