基于鲁棒性目标的关键链项目调度优化

发布时间：2018-03-06 15:34

本文选题：关键链　切入点：鲁棒性　出处：《西北工业大学》2015年硕士论文　论文类型：学位论文

【摘要】：经济全球化的发展使得市场竞争不断增强,项目实施环境的不确定性也不断增大。关键链项目管理方法和鲁棒性项目调度作为两种主要的不确定型项目调度理论方法,已经得到学术界和企业界的重视和关注。本文以提高关键链项目管理方法的动态适用性为切入点,从多目标角度拓展基本鲁棒性项目调度优化问题,提出基于鲁棒性目标的关键链项目调度优化问题。首先,本文对于传统关键链项目管理困境,本文从鲁棒优化的角度提出一种启发式的协调策略。基于消除二次资源冲突的过程,本文设计了考虑两次调度过程和两类缓冲动态消耗的度量指标来量化关键链调度方案的鲁棒性,同时采用项目调度问题算例库PSPLIB的生成器随机产生较多的测试算例,通过离散仿真实验验证了鲁棒性度量指标的有效性。其次,本文构建了以鲁棒性为目标,考虑两次调度中活动间约束关系的鲁棒性关键链项目调度优化模型CCPSP-R,采用嵌入模型特征的启发式遗传算法求解模型,并设计实验和测试算例集来验证CCPSP-R模型的可行性。最后,本文同时嵌入项目工期和鲁棒性两个目标,构建了多目标鲁棒性项目调度问题模型MOCCPSP-R,通过非支配性排序多目标遗传进化算法NSGA-II来求解模型,得到由多个相互之间无支配性关系的单个最优解构成的Pareto最优解集合。本论文为传统关键链项目管理方法和基本鲁棒性项目调度提供新的拓展视角,丰富了项目调度和多目标调度优化理论,同时也给项目管理者及实践者科学地运用关键链项目管理方法提供了理论指导,对于提高以项目化方式运作的企业的竞争力具有重要的意义。
[Abstract]:With the development of economic globalization, the market competition is increasing and the uncertainty of the project implementation environment is increasing. The key chain project management method and the robust project scheduling method are two main uncertain project scheduling theory methods. This paper focuses on improving the dynamic applicability of the key chain project management method and extends the basic robust project scheduling optimization problem from the multi-objective point of view. This paper proposes a key chain project scheduling optimization problem based on robust objectives. Firstly, this paper focuses on the traditional critical chain project management dilemma. In this paper, a heuristic coordination strategy is proposed from the point of view of robust optimization. In this paper, we design a metric to quantify the robustness of the critical chain scheduling scheme considering the twice scheduling process and two kinds of dynamic consumption of buffers. At the same time, the generator of PSPLIB, a project scheduling example library, is used to generate more test examples at random. The effectiveness of the robustness metrics is verified by discrete simulation experiments. Secondly, the robustness is the target of this paper. Considering the robustness of constraint relationship between activities in two scheduling, the critical chain scheduling optimization model CCPSP-Ris used to solve the model with heuristic genetic algorithm embedded in the characteristics of the model, and an experimental and test example set is designed to verify the feasibility of the CCPSP-R model. In this paper, a multi-objective robust project scheduling problem model MOCCPSP-R is constructed by embedding both project duration and robustness objectives, and the model is solved by non-dominated scheduling multi-objective genetic evolutionary algorithm (NSGA-II). A set of Pareto optimal solutions consisting of a single optimal solution with no dominant relationship between them is obtained. This paper provides a new extended perspective for the traditional critical chain project management method and the basic robust project scheduling. It not only enriches the theory of project scheduling and multi-objective scheduling optimization, but also provides theoretical guidance for project managers and practitioners to use key chain project management methods scientifically. It is of great significance to improve the competitiveness of enterprises operating in project mode.
【学位授予单位】：西北工业大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：F272

【参考文献】