Polynomial Approximation of the Activity Completion Time Distribution in Network Chart

摘要

A method for calculating the activity completion time distribution in network chart based on polynomial approximations is presented. The method allows us to describe the activity time distributions of both individual activities and their various combinations (such as sum, maximum, and minimum) in a uniform manner.