A NEW LOWER BOUND FOR COMPLETION TIME DISTRIBUTION FUNCTION OF
STOCHASTIC PERT NETWORKS

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.

RABANI M.; REZAEI K.; LOTFI M.M

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

Journal Paper

Paper Information

Journal: ESTEGHLAL Year:2004 | Volume:23 | Issue:1 Page(s): 49-70

Download Full-Text

Persian Verion

View:

814

Download:

Cites:

Information Journal Paper

Title

A NEW LOWER BOUND FOR COMPLETION TIME DISTRIBUTION FUNCTION OF STOCHASTIC PERT NETWORKS

Author(s)

RABANI M. | REZAEI K. | LOTFI M.M | Issue Writer Certificate

Keywords

NETWORKQ4

STOCHASTICQ4

PERTQ4

LOWER BOUNDQ4

Abstract

In this paper, a new method for developing a LOWER BOUND on exact compietion time distribution function of STOCHASTIC PERT lIetworks is provided that is based on simplifying the structure of this type of NETWORK. The designed mechanism simplifies NETWORK structure by arc duplication so that NETWORK distribution function can be calculated only with convolution and multiplication. The selection of dupllcable arcs in this method differs from that of Dodin"s so that it must be considered a different method. In this method, best duplicable arcs are adopted using a new mechanism. It is proved that duplicating numbers is minimized by this method. The distribution function of this method is a LOWER BOUND on exact NETWORK distribution function and an upper bound on distribution function of Dodin"s and Kleindorfer"s methods. After the algorithm for the method is presented, its efficiency is discussed and illustration examples will be used to Compare numerical results from this method with those from exact NETWORK distribution and Dodin"s method.

Cites

No record.

References

No record.

Cite

APA: Copy

RABANI, M., REZAEI, K., & LOTFI, M.M. (2004). A NEW LOWER BOUND FOR COMPLETION TIME DISTRIBUTION FUNCTION OF STOCHASTIC PERT NETWORKS. ESTEGHLAL, 23(1), 49-70. SID. https://sid.ir/paper/5988/en

Vancouver: Copy

RABANI M., REZAEI K., LOTFI M.M. A NEW LOWER BOUND FOR COMPLETION TIME DISTRIBUTION FUNCTION OF STOCHASTIC PERT NETWORKS. ESTEGHLAL[Internet]. 2004;23(1):49-70. Available from: https://sid.ir/paper/5988/en

IEEE: Copy

M. RABANI, K. REZAEI, and M.M LOTFI, “A NEW LOWER BOUND FOR COMPLETION TIME DISTRIBUTION FUNCTION OF STOCHASTIC PERT NETWORKS,” ESTEGHLAL, vol. 23, no. 1, pp. 49–70, 2004, [Online]. Available: https://sid.ir/paper/5988/en

Related Journal Papers