%0 Journal Article
%T Research of Multi-Mode Resource-Constrained Project Scheduling Problem Based on Genetic Algorithm<br>基于遗传算法的多模式资源约束项目调度问题研究
%A WANG Wei-xin
%A LI Yuan
%A ZHANG Kai-fu
%A <br>王为新
%A 李原
%A 张开富
%J 计算机应用研究
%D 2007
%I 
%X 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.
%K Multi-Mode
%K Resource-Constrained
%K Project Scheduling
%K Genetic Algorithm<br>多模式
%K 资源约束
%K 项目调度
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=343459AF1736CA697D867FA5F11616C4&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=CA4FD0336C81A37A&sid=AA76E167F386B6B3&eid=67969BA850333433&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=8