Lower bound for the mean project completion time in dynamic PERT networks

被引：11

作者：

Azaron, Amir ^{[1
]}

Ghomi, S. M. T. Fatemi

机构：

[1] Dalhousie Univ, Dept Ind Engn, Halifax, NS, Canada

[2] Amirkabir Univ Technol, Dept Ind Engn, Tehran, Iran

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2008年 / 186卷 / 01期

关键词：

markov processes; project management and scheduling; dynamic programming;

D O I：

10.1016/j.ejor.2007.01.015

中图分类号：

C93 [管理学];

学科分类号：

12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

We apply the stochastic dynamic programming to obtain a lower bound for the mean project completion time in a PERT network, where the activity durations are exponentially distributed random variables. Moreover, these random variables are non-static in that the distributions themselves vary according to some randomness in society like strike or inflation. This social randomness is modelled as a function of a separate continuous-time Markov process over the time horizon. The results are verified by simulation. (c) 2007 Elsevier B.V. All rights reserved.

引用

页码：120 / 127

页数：8

共 22 条

[1]

Evaluating project completion times when activity times are Weibull distributed [J].