Research On The Project Optimization Scheduling Based On Criticle Chain

As a new project scheduling technology, critical chain method has been aresearch focus in project management theory and practice. The critical chainproject management aims to the project global optimization and realizes thethought of system engineering management by considering resource constraintsand uncertainties. However, due to many factors, such as current technical means,resource constraints and uncertainties, it is very difficult to make the criticalchain project plan in manual way. There has not been a mature method togenerate a critical chain project plan in automatic way so far. For the purpose ofapplying critical chain method in the large-scale projects, this paper studies theoptimization models and their solutions for the critical chain project schedule.This work provides several practical and effective approaches for the applicationof critical chain method in complex project environments.Firstly, the paper summarizes the research status of critical chain projectmanagement, and describes related theories and technologies. Then, a singlemodel critical chain project scheduling problem is presented to minimize theproject duration, in which a simplified mechanism of critical chain method isused. After that, aiming to more complicated project requirements andmultiple-objective optimization, a multiple mode critical chain proj ectscheduling problem is described and formulated.Critical chain project scheduling problem inherits all the features ofresource constrained project scheduling problems, and thus it is also a NP hardproblem, which is difficult to be solved for the large-scale real-life project. Inthis paper, a heuristic algorithm based on activity priority rules is designed tosearch the critical chain for the single mode critical chain project schedulingproblem, and the performances of different priority rules used i n the criticalchain project scheduling problem is investigated.Compared with the single mode one, the multi-mode critical chain projectscheduling problem is more difficult to be solved. By combining mode priorityrules and activity priority rules, a two-stage heuristic algorithm based on priorityrules is studied. Moreover, according to the characteristics of the multi-mode critical chain project scheduling problem, an improved genetic algorithm forsolving the problem is developed. All these algorithms are tested on the standardinstances in PSPLIB, and the computation results show that these algorithms areeffective enough to meet the practical application requirement.Project management is a multi-objective problem in nature. Although theresource constraints and uncertainties are considered in the current research ofcritical chain project scheduling, minimizing project duration is still the uniqueobject so far. In this paper, a discrete time/cost trade-off problem based oncritical chain is put forward and formulated. Subsequently, the differentialevolution algorithm for solving the problem is designed, in which the encodingscheme and evolution mode is improved according to the characteristics of theproblem. The performance of algorithm is verified by computation experiments.To facilate the implement of the CCM on the project management practice,the system analyze and design of the critical chain project scheduling system isgiven by using Object-oriented method on the funndation of previous theoryresearches. Due to the requirement of data integration, the heterogeneous dataexchange method of the critical chain project scheduling system is investigated.Finally, the the critical chain project scheduling system is realized andimplemented.