Volume 23, Issue 4 (IJIEPM 2013)                   2013, 23(4): 471-484 | 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. Due Date Assignment for Delivery Time in Multi-Server Dynamic PERT Networks . Journal title 2013; 23 (4) :471-484
URL: http://ijiepm.iust.ac.ir/article-1-569-en.html
Iran University of Science & Technology , snoori@iust.ac.ir
Abstract:   (7725 Views)
In this paper, multi-class dynamic PERT network is considered as a queueing network, where the projects are similar and new projects are generated according to a Poisson process. Each activity is performed independently in its corresponding service station with exponential distribution by one server from several servers settled in service station based on FCFS (Fist Come, First Served) discipline. Also, each project’s end result has a penalty cost that is some linear function of its due-date and its actual completion time. In this investigation, for computing the due date for multi-class dynamic PERT network, we first convert the queueing network into a stochastic network. Then, by constructing an appropriate finite-state continuous-time Markov model, a system of differential equations is created to solve and find the project completion time distribution for any particular project, analytically. Finally, the optimal due date for delivery time is obtained by using a linear function of its due-date and minimizing the expected aggregate cost per project.
Full-Text [PDF 1057 kb]   (5504 Downloads)    
Type of Study: Applicable | Subject: Material Management
Received: 2011/05/21 | Published: 2013/02/15

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

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.