基于关键链多项目鲁棒调度  

Multi-project robust scheduling based on critical chain

作　　者：刘琼[1] 林魁[1] 张超勇[1] 朱海平[1] 

机构地区：[1]华中科技大学机械科学与工程学院数字制造装备与技术国家重点实验室,湖北武汉430074

出　　处：《计算机集成制造系统》2012年第4期813-820,共8页Computer Integrated Manufacturing Systems

基　　金：国家863计划资助项目(2007AA04Z190;2009AA043301);国家自然科学基金重点资助项目(51035001)~~

摘　　要：为提高关键链项目调度解的鲁棒性,以鲁棒性指标最大化和多项目工期最小化为目标,提出基于关键链的多项目鲁棒性调度模型。在求解模型方面,为打破优先规则的局限,求解得到解的鲁棒性和质量鲁棒性均较优的关键链调度方案,提出一种关键链多项目调度混合优化算法,通过遗传算法寻找活动的优先权列表,结合基于优先权的关键链多项目调度算法,生成关键链多项目调度计划。通过算例验证并与其他算法进行比较,验证了所提模型和算法的有效性。To improve the solution robustness of critical chain project scheduling,a critical chain based multi-project robustness scheduling model was proposed by taking robustness indicator maximum and project duration minimum as target.To break the limitation of priority rules and to ensure the critical chain scheduling with better solution robustness and quality robustness,a hybrid optimization algorithm of critical chain project scheduling was designed.Through genetic algorithm,the activities priority list was fund,and then the critical chain scheduling planning was generated by combining priority-based critical chain scheduling algorithm.Effectiveness of the proposed robustness scheduling model and hybrid algorithm were verified by a case study.

关 键 词：多项目调度 关键链 鲁棒性 遗传算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]