Research On Critical Chain Rescheduling After Inserting Buffers

Nowadays success of projects is a great feature of the competitiveness of enterprises. Agood management method can help project succeed. Critical Path Method, which is thetraditional famous project management method, is now proved to be having problems whilemaking projects plans. Dr Goldratt had brought his idea of―Theory of Constraints‖intoproject area to provide a new method called―Critical Chain‖. Critical Chain has got muchsuccess in practice so that more and more companies tend to use it. Furthermore, learners doa lot of researches in critical chain methods. These lectures mainly focus in the subjects ofindentifying critical chain and inserting buffers.However, resource conflicting may be occurred again after inserting buffers and theproblem was usually ignored. This paper analyzes the influence of projects acting cause byproblems inserting buffers and aim to provide a system method to give a feasible criticalchain schedule with buffers inserting. A two-stage algorithm is designed to solve the problem.In the first stage, critical chain will be identified and buffers will be inserted. Whileidentifying the critical chain, a new method called weighted resource utilization rate is usedto improve traditional peak mechanism. The second stage made use of dynamic algorithmand genetic algorithm to deal with the resource conflicting and at last bring out the feasibleproject plan. Experiment showed that more than98%projects succeed in obtaining the finalcritical chain project plan without resource conflicting. The new plan is also prove to declineproject delaying and conflicting by simulating so that the algorithm is effective.