Algorithm for CPM Computations with Single Mode Activities

CPM is still the most popular network technique for construction projects. However CPM is very limited in scope when project deadline is restricted. This is because in conventional CPM each activity is assumed to have one fixed duration and corresponding normal cost. Thus the Project duration is fixed and project Manager do not have any control if the project is required to be completed within an earlier deadline as compared to project duration. The project duration is computed by summing the durations of only those activities that lie along the critical path. The project cost is the sum of cost of all activities of project. Hence Time cost trade-off technique is to be applied to CPM to overcome above restriction. For this CPM computations needs to be formulated. The paper presents an algorithm for CPM computations with single mode activities i. e. when each activity is assumed to have a fixed duration and cost.