A study of Critical Path Algorithm based on Transforming Complex Relations into Dummy Tasks

摘要

In order to solve the difficulty of calculating critical path because of complex relations among tasks in the course of product R&D project, the paper analyzes the four relations and their time attributes. A new Critical Path Algorithm based on Transforming Complex Relations into Dummy Tasks (TCRDT) and the concept of pseudo critical task and latent sink are presented. In the TCRDT algorithm the start and end points of task are transformed into nodes, and the four relations into dummy tasks, of which the meanings are extended. Then a directed acycline graph is got. The critical path is sought by calculating the latest and earliest start time and end time, and their gap. At the same time, the pseudo critical task and latent sink are identified, and delete the task and nodes between the sink and the latent sink, because they have no contribute to critical path. The real project duration is found and the pressure of project management is lightened.