An algorithm to solve the time–cost trade-offs problem in precedence diagramming

In this paper we give a fast, new algorithm for the Time–Cost Trade-Offs problem in precedence diagramming. We allow the following precedence relationships between the activities: Start-to-Start, End-to-Start, End-to-End, End-to-Start. Starting from an optimal solution whose project duration P is that calculated using the normal duration of activities we can reach an optimal solution with a smaller project duration and higher cost. The algorithm is based on network flow theory.