EOR project networks
This paper considers project networks all of whose nodes have an exclusive- or entrance and whose arc weights consist of the execution probabilities and distribution functions of the durations of the respective project activities. EOR networks have some nice properties, for example, a set of Markov renewal processes can be assigned to such a network. The renewal functions of those processes correspond to special activation functions of the network and can (approximately) be computed very efficiently. At last a method for the complete evaluation of an EOR project network in the sense of time planning is presented.
- scientific article; zbMATH DE number 3939077
- Recent Developments In Stochastic Activity Networks
- Stochastic project networks. Temporal analysis, scheduling and cost minimization
- Computing the probability distribution of project duration in a PERT network
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- scientific article; zbMATH DE number 3939077 (Why is no real title available?)
- Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness
- Analysis of a time-cost trade-off in a resource-constrained GERT project scheduling problem using the Markov decision process
This page was built for publication: EOR project networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760101)