Volume 23, Number 1 (7-2004)                   JCME 2004, 23(1): 49-69 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

M. Rabbani, K. Rezaie, M. M. Lotfi and M. Abadi. A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks. JCME. 2004; 23 (1) :49-69
URL: http://jcme.iut.ac.ir/article-1-302-en.html

Abstract:   (918 Views)
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks 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 duplicable 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.
Full-Text [PDF 457 kb]   (130 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25

Add your comments about this article : Your username or email:
Write the security code in the box

© 2015 All Rights Reserved | Computational Methods in Engineering

Designed & Developed by : Yektaweb