遗传算法的关键链项目调度基准计划问题研究  

The Benchmark Plan of Critical Chain Project Scheduling Based on the Genetic Algorithm

作　　者：金敏力[1,2] 冯玉强[1] 

机构地区：[1]哈尔滨工业大学管理学院,黑龙江哈尔滨150001 [2]沈阳理工大学教务处,辽宁沈阳110159

出　　处：《沈阳理工大学学报》2013年第2期43-47,52,共6页Journal of Shenyang Ligong University

摘　　要：关键链法是一种新的项目调度技术,近年已成为项目管理理论研究和实践的热点。本文面向大规模项目管理的应用需求,研究关键链项目调度的优化问题模型和求解算法,为关键链项目调度问题基准计划的产生设计一种遗传算法,并验证所提出算法的有效性。As a new project scheduling technology, critical chain method has been a research focus in project management theory and practice. For the purpose of applying critical chain method in the large-scale projects, this paper studies the optimization models and their solutions for the critical chain project schedule. This paper studies the benchmark plan of the critical chain project scheduling problem and proposes a new genetic algorithm to solve this problem. And the effectiveness of this new genetic algorithm is verified by the simulation experiments and comparison.

关 键 词：基准计划 关键链项目调度 遗传算法 项目管理 

分 类 号：TH16[机械工程—机械制造及自动化] TP19[自动化与计算机技术—控制理论与控制工程]