Calculating the theoretical project completion time of large networks in polynomial processing time

Knowledge and technology-based organizations rely on large activity networks to manage R&D projects. Avoiding optimistic completion times due to the characteristic PERT assumptions is a problem that can grow exponentially in complexity with the number of activities. We have developed a recursive technique that solves the problem in a polynomial number of steps, assuming that all duration times follow beta distributions.