基于关键链的多项目鲁棒调度研究
发布时间：2018-11-12 11:05
【摘要】：现代的项目由于创新性强、规模巨大、资源需求复杂、并行程度高,调度计划往往难以如期执行。在这种情况下,国内外学者开始展开资源约束下多项目鲁棒调度的研究,资源约束下多项目鲁棒调度不仅充分考虑资源约束对项目的影响,还充分考虑了项目在实际执行过程中的各种不确定因素,能够有效对抗不确定因素带来的项目延期风险,提高项目完工的质量,具有很高的理论研究价值和实际应用价值。 关键链项目管理理论自诞生以来,获得了广泛应用并取得巨大成功,大量实际应用也证明了关键链项目调度能够在有效缩短项目工期的同时提高项目的按时完工率,具备着质量鲁棒性较好的特点。然而关键链项目调度通过活动工期削减,集中设置缓冲的方法使得项目调度的工期对活动工期的变化变得不敏感,这也使得单个活动容易超期,进而导致其后续活动开始时间变得不稳定,使调度的解鲁棒性变差。针对这个问题,本文以鲁棒性指标最大化和多项目工期最小化,提出了基于关键链的多项目鲁棒调度模型。 在求解基于关键链的多项目鲁棒调度模型方面,传统的关键链多项目调度采用各个项目各自寻找关键链,然后交错执行规避瓶颈的办法,在处理多资源约束的复杂多项目调度问题时,这种交错规避很容易产生新的瓶颈,导致难以生成有效的关键链多项目调度,此外传统的多项目调度建立在一定优先规则的基础上,有限的优先规则不能保证寻求到最优解。因此,本文提出一种基于关键链的多项目调度混合优化算法,算法分为两个模块,为打破优先规则的局限性,采用遗传算法寻找项目活动的最优优先权列表;针对传统关键链多项目调度算法难以解决复杂多资源约束的多项目调度问题,提出了基于优先权的关键链多项目调度算法,两个算法相互结合,确保得到解的鲁棒性和质量鲁棒性均较优的关键链调度方案。随后本文通过算例验证,并与其他算法进行比较,验证了算法的有效性,通过仿真实验验证了本文提出的鲁棒性调度模型能够有效提高调度方案的鲁棒性。 最后对本文工作做出了总结并提出了进一步研究的方向。
[Abstract]:Because of its strong innovation, large scale, complex resource requirements and high degree of parallelism, modern projects are often difficult to execute on schedule. In this case, scholars at home and abroad began to study the multi-project robust scheduling under resource constraints, and the multi-project robust scheduling under resource constraints not only fully considered the impact of resource constraints on the project. It also fully considers all kinds of uncertain factors in the process of project implementation, which can effectively resist the risk of project extension caused by uncertain factors, and improve the quality of project completion. It has high theoretical research value and practical application value. Since the birth of the critical chain project management theory, it has been widely used and achieved great success. A large number of practical applications have also proved that the key chain project scheduling can effectively shorten the project duration and improve the project completion rate on time. It has good quality robustness. However, the key chain project schedule is reduced by the activity duration, and the method of centralizing buffering makes the project schedule less sensitive to the change of the activity duration, which makes it easy for a single activity to overrun. Then the starting time of subsequent activities becomes unstable, and the solution robustness of scheduling becomes worse. Aiming at this problem, a robust scheduling model based on critical chain is proposed in this paper, which is based on robustness maximization and multi-project duration minimization. In solving the multi-project robust scheduling model based on the critical chain, the traditional key chain multi-project scheduling uses each project to find the key chain, and then interlaced to implement the method of avoiding the bottleneck. When dealing with the complex multi-project scheduling problem with multi-resource constraints, this interlaced avoidance is easy to produce new bottlenecks, which makes it difficult to generate effective key chain multi-project scheduling. In addition, the traditional multi-project scheduling is based on certain priority rules, and the finite priority rules can not guarantee the optimal solution. Therefore, this paper proposes a hybrid optimization algorithm for multi-project scheduling based on key chain. The algorithm is divided into two modules. In order to break the limitation of priority rules, genetic algorithm is used to find the optimal priority list of project activities. In view of the difficulty of solving the multi-project scheduling problem with complex multi-resource constraints by traditional critical chain multi-project scheduling algorithm, a priority based key chain multi-project scheduling algorithm is proposed, and the two algorithms are combined with each other. A critical chain scheduling scheme that ensures the robustness and quality robustness of the solution. Then the effectiveness of the algorithm is verified by an example and compared with other algorithms. The simulation results show that the proposed robust scheduling model can effectively improve the robustness of the scheduling scheme. Finally, the work of this paper is summarized and the direction of further research is put forward.
【学位授予单位】：华中科技大学
【学位级别】：硕士
【学位授予年份】：2011
【分类号】：TH186
本文编号：2326923
[Abstract]:Because of its strong innovation, large scale, complex resource requirements and high degree of parallelism, modern projects are often difficult to execute on schedule. In this case, scholars at home and abroad began to study the multi-project robust scheduling under resource constraints, and the multi-project robust scheduling under resource constraints not only fully considered the impact of resource constraints on the project. It also fully considers all kinds of uncertain factors in the process of project implementation, which can effectively resist the risk of project extension caused by uncertain factors, and improve the quality of project completion. It has high theoretical research value and practical application value. Since the birth of the critical chain project management theory, it has been widely used and achieved great success. A large number of practical applications have also proved that the key chain project scheduling can effectively shorten the project duration and improve the project completion rate on time. It has good quality robustness. However, the key chain project schedule is reduced by the activity duration, and the method of centralizing buffering makes the project schedule less sensitive to the change of the activity duration, which makes it easy for a single activity to overrun. Then the starting time of subsequent activities becomes unstable, and the solution robustness of scheduling becomes worse. Aiming at this problem, a robust scheduling model based on critical chain is proposed in this paper, which is based on robustness maximization and multi-project duration minimization. In solving the multi-project robust scheduling model based on the critical chain, the traditional key chain multi-project scheduling uses each project to find the key chain, and then interlaced to implement the method of avoiding the bottleneck. When dealing with the complex multi-project scheduling problem with multi-resource constraints, this interlaced avoidance is easy to produce new bottlenecks, which makes it difficult to generate effective key chain multi-project scheduling. In addition, the traditional multi-project scheduling is based on certain priority rules, and the finite priority rules can not guarantee the optimal solution. Therefore, this paper proposes a hybrid optimization algorithm for multi-project scheduling based on key chain. The algorithm is divided into two modules. In order to break the limitation of priority rules, genetic algorithm is used to find the optimal priority list of project activities. In view of the difficulty of solving the multi-project scheduling problem with complex multi-resource constraints by traditional critical chain multi-project scheduling algorithm, a priority based key chain multi-project scheduling algorithm is proposed, and the two algorithms are combined with each other. A critical chain scheduling scheme that ensures the robustness and quality robustness of the solution. Then the effectiveness of the algorithm is verified by an example and compared with other algorithms. The simulation results show that the proposed robust scheduling model can effectively improve the robustness of the scheduling scheme. Finally, the work of this paper is summarized and the direction of further research is put forward.
【学位授予单位】：华中科技大学
【学位级别】：硕士
【学位授予年份】：2011
【分类号】：TH186
【引证文献】
相关硕士学位论文 前1条
1 曾金凤;基于关键链技术的项目进度管理研究[D];重庆大学;2012年
，本文编号：2326923
本文链接：https://www.wllwen.com/kejilunwen/jixiegongcheng/2326923.html
