Crashing in the Optimal Project Management: Cut Search Method V s. Linear Programming Method

Abstract

The paper compares Cut Search Method and Linear Programming Method to the project time-cost trade- off analysis as a practical application and a conceptual development. Both the solution procedures are presented in this paper to determine the minimum resource utilization requirement to reduce the total project completion time from a normal to a crash condition. The study would help management in selecting the appropriate method for getting optimal crashing decision. The study finds Linear Programming method is better than Cut Search method. Linear Programming approach is also very much suitable to a broad range of practical project management problems, which provide some flexibility. Finally, the study suggests for using Linear Programming Method to the crashing project duration of urgent projects in the pipeline of ADP and private sector projects as well.