Volume 24, Issue 3 (11-2013)                   2013, 24(3): 349-360 | Back to browse issues page

XML Persian Abstract Print

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

Noori S, Yaghoubi S. Calculating the Mean Project Completion Time in Dynamic PERT Networks with Finite Capacity. Journal title 2013; 24 (3) :349-360
URL: http://ijiepm.iust.ac.ir/article-1-552-en.html
Iran University of Science & Technology , snoori@iust.ac.ir
Abstract:   (5409 Views)
In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity is performed independently in its corresponding service station with exponential distribution. For calculating the mean project completion time in dynamic PERT network with finite capacity, we first convert the network of queues into a stochastic network. Then, by constructing a proper finite-state continuous-time Markov model, a system of differential equations is created. to solve and find the manufacturing lead time distribution for any particular work, analytically. Finally, by using Little’s Theorem the mean project completion time is obtained.
Full-Text [PDF 841 kb]   (2356 Downloads)    
Type of Study: Applicable | Subject: Material Management
Received: 2011/04/26 | Accepted: 2014/02/2 | Published: 2014/02/2

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.