Scheduling Markovian PERT networks with maximum-NPV objective.

Abstract

We examine project scheduling with net-present-value objective and exponential activity durations, using a continuous-time Markov decision chain. Based on a judicious partitioning of the state space, we achieve a significant performance improvement compared to the existing algorithms.Project scheduling; Net present value; Stochastic activity durations; Exponential distribution;