PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS WITH GENERATING PROJECTS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

AZARON A.; MODARES M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Scientia Iranica Year:2007 | Volume:14 | Issue:1 Page(s): 56-63

Download Full-Text

View:

434

Download:

233

Cites:

Information Journal Paper

Title

PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS WITH GENERATING PROJECTS

Author(s)

AZARON A. | MODARES M. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In this paper, an analytical method is developed to compute the project completion time distribution in a dynamic PERT network, where the activity durations are exponentially distributed random variables. The projects are generated according to a renewal process and share the same facilities. Thus, these projects cannot be analyzed independently. The authors' approach is to transform this dynamic PERT network into a stochastic network and. then, to obtain the project completion time distribution by constructing a proper continuous-time Markov chain. This dynamic PERT network is represented as a network of queues, where the service times represent the durations of the corresponding activities and the arrival stream to each node follows a renewal process. Finally, the proposed methodology is extended to the generalized Erlang activity durations.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

AZARON, A., & MODARES, M.. (2007). PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS WITH GENERATING PROJECTS. SCIENTIA IRANICA, 14(1), 56-63. SID. https://sid.ir/paper/289380/en

Vancouver: Copy

AZARON A., MODARES M.. PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS WITH GENERATING PROJECTS. SCIENTIA IRANICA[Internet]. 2007;14(1):56-63. Available from: https://sid.ir/paper/289380/en

IEEE: Copy

A. AZARON, and M. MODARES, “PROJECT COMPLETION TIME IN DYNAMIC PERT NETWORKS WITH GENERATING PROJECTS,” SCIENTIA IRANICA, vol. 14, no. 1, pp. 56–63, 2007, [Online]. Available: https://sid.ir/paper/289380/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops