EXPECTED DURATION OF DYNAMIC MARKOV PERT NETWORKS
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 18، Issue: 3
Publish Year: 1386
نوع سند: مقاله ژورنالی
زبان: English
View: 700
This Paper With 5 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-18-3_001
تاریخ نمایه سازی: 7 شهریور 1393
Abstract:
In this paper, we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in accordance with the independent semi-Markov processes over the planning horizon. By using the stochastic dynamic programming, we find a dynamic path with maximum expected length from the source node to the sink node of the stochastic dynamic network. The expected value of such path can be considered as an approximation for the mean project completion time in the original dynamic PERT network.
Keywords:
Authors
Amir Azaron
is with the Department of Industrial Engineering, University of Bu-Ali-Sina, Hamadan
S.M.T. Fatemi Ghomi
is with the Department of Industrial Engineering, Amirkabir University of Technology