http://hdl.handle.net/10453/201 Tue, 21 May 2013 12:04:59 GMT 2013-05-21T12:04:59Z http://hdl.handle.net/10453/19483 Calculating Project Completion in Polynomial Processing Time Copertari, Luis Technology-based organizations and knowledge organizations rely on large activity networks to manage Research & Development (R&D) projects. Avoiding optimistic completion times due to the characteristic Program Evaluation and Review Technique (PERT) assumptions is a problem that can grow exponentially in complexity with the number of activities. A recursive technique that solves the problem in a polynomial number of steps has been developed, assuming that all duration times follow beta distributions. It is important to notice that the only two 100% valid approaches to calculate the project completion time are simulation and the stochastic sum for each and every path in the network. Nevertheless, both require finding the shape parameters, and that is precisely the main contribution of this paper: a system of equations to calculate the shape parameters of each activity and the overall project. Wed, 12 Dec 2012 00:00:00 GMT http://hdl.handle.net/10453/19483 2012-12-12T00:00:00Z