Kybernetika

It is assumed that activity times in stochastic activity networks (SANs) are independent Erlang random variable (r.v.). A recurrence method of determining the $k$th moments of the completion time is presented. Applications are provided for illustration and are used to evaluate the applicability and appropriateness of the Erlang model to represent activity network.