DocumentCode
3514120
Title
Calculating the theoretical project completion time of large networks in polynomial processing time
Author
Copertari, Luis F. ; Archer, Norman P.
Author_Institution
Sch. of Bus., McMaster Univ., Hamilton, Ont., Canada
Volume
Supplement
fYear
2001
fDate
2001
Firstpage
577
Abstract
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
Keywords
PERT; polynomials; project management; research and development management; R&D projects management; characteristic PERT assumptions; criticality index; knowledge-based organizations; large activity networks; polynomial processing time; recursive technique; stochastic sum; technology-based organizations; theoretical project completion time; Delay; Density functional theory; Gaussian distribution; Intelligent networks; Polynomials; Project management; Research and development; Research and development management; Shape; Technology management;
fLanguage
English
Publisher
ieee
Conference_Titel
Management of Engineering and Technology, 2001. PICMET '01. Portland International Conference on
Conference_Location
Portland, OR
Print_ISBN
1-890843-06-7
Type
conf
DOI
10.1109/PICMET.2001.952246
Filename
952246
Link To Document