一种求解多目标资源受限项目调度的遗传算法  

Genetic algorithm for multi-objective resource-constrained project scheduling problem.

作　　者：王宏[1] 林丹[1] 李敏强[2] 

机构地区：[1]天津大学理学院数学系,天津300072 [2]天津大学系统工程研究所,天津300072

出　　处：《计算机工程与应用》2008年第7期1-4,12,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(the NationalNatural Science Foundation of Chinaunder Grant No.70571057,No.70301005)

摘　　要：采用基于非支配性排序的多目标遗传算法—NSGA-Ⅱ,设计了一种求解多模式、多种类资源约束的多目标资源受限项目调度问题的遗传算法,该算法所设计的编码包含两部分,一部分为一个任务链表,另一部分为任务链表中各任务所对应的执行模式组成的模式向量。将所设计的算法用于求解文献中的以项目总工期和资源均衡为目标的农业项目调度问题,结果表明此算法对于求解多目标资源受限项目调度问题是有效的。This paper proposed a multi-objective evolutionary algorithm called the Fast Elitist Non-Dominated Sorting Genetic Algorithm （NSGA-Ⅱ） to solve resource-constrained project scheduling problem with multiple activity performance modes and two objectives to minimize project makespan and resource utilization smoothness.The solution is represented by a precedence feasible activity list and a mode assignment.An agricultural example with two objectives is used to test the performance of algorithm proposed.The results show that the algorithm proposed by us is efficient for solving the multi-objective resource-constrained project scheduling problem.

关 键 词：资源受限 项目调度 多目标 遗传算法 

分 类 号：C93[经济管理—管理学]