Calculating Project Completion in Polynomial Processing Time

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Copertari, Luis
dc.date.accessioned 2012-12-12T01:02:13Z
dc.date.available 2012-12-12T01:02:13Z
dc.date.issued 2012-12-12
dc.identifier.other Book
dc.identifier.uri http://hdl.handle.net/10453/19483
dc.description.abstract 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. en_US
dc.language.iso en en_US
dc.subject project management en_US
dc.subject completion time en_US
dc.subject scheduling en_US
dc.subject complex networks en_US
dc.subject decision support en_US
dc.subject group support systems en_US
dc.subject business information systems en_US
dc.title Calculating Project Completion in Polynomial Processing Time en_US
dc.type Book en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record