Expected Duration of Dynamic Markov PERT Networks
Authors
Abstract:
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.
similar resources
Expected Duration of Dynamic Markov Pert Networks
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 wit...
full textresource allocation in multi-server dynamic pert networks using multi-objective programming and markov process
in this research, both resource allocation and reactive resource allocation problems in multi-server dynamic pert networks are analytically modeled, where new projects are expected to arrive according to a poisson process, and activity durations are also known as independent random variables with exponential distributions. such system is represented as a queuing network, where multi servers at ...
full textDynamic interdiction games on PERT networks
In a PERT network interdiction game one player tries to get a project, represented as a PERT graph, finished as quickly as possible by allocating resources, expediting the project’s tasks and choosing between different technologies to use. At the same time a second player aims to maximally delay the project’s completion date by carefully choosing which tasks to disrupt. We develop a novel conti...
full textResource allocation in multi-server dynamic PERT networks using multi-objective programming and Markov process
In this research, both resource allocation and reactive resource allocation problems in multi-server dynamic PERT networks are analytically modeled, where new projects are expected to arrive according to a Poisson process, and activity durations are also known as independent random variables with exponential distributions. Such system is represented as a queuing network, where multi servers at ...
full textA multi-objective resource allocation problem in dynamic PERT networks
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and the new projects are generated according to a Poisson process. This dynamic PERT network is represented as a network of queues, where the service times represent the durations of the corresponding activities and the arr...
full textA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.
In series-parallel SPN, the completion time distribution...
full textMy Resources
Journal title
volume 18 issue 3
pages 1- 5
publication date 2007-11
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023