English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In some of the real world projects, there exists an uncertainty in realization of some activities. Furthermore, duration of activities is non¬-deterministic. So, GERT networks are used to describe these projects; but there is a certain type among these projects, which is completed by completing one path out of various paths of the network. Therefore, in this research, it is assumed that the project can be shown as a GERT network with exclusive-or probabilistic nodes. Also, it is supposed that the network has one or more than one loops. It is supposed that the duration of activities is known random variables. It is obvious that the completion time of project is a random variable too. Project managers are interested to recognize the cumulative distribution function of completion time in due date. Analytical methods cannot obtain the above-mentioned function. In addition, due to tedious efforts in analytical methods for computing the moments of completion time, a new heuristic algorithm has been developed to analyze the network. The new algorithm can compute the cumulative distribution function of completion time of the project. Besides, time distribution of realization of each end node can be computed. A computer program has been written based on the proposed new computational algorithm. Finally, two examples have been solved using the proposed algorithm. Keywords—GERT Network; Project Completion Time; Loop; Exclusive-or Probabilistic

Computational Algorithm for Defining the Completion Time of GERT-type Networks with Exclusive-or, Probabilistic Nodes