Scheduling Markovian PERT networks to maximize the net present value
From MaRDI portal
Publication:2270324
DOI10.1016/j.orl.2009.10.006zbMath1182.90016MaRDI QIDQ2270324
Roel Leus, Stefan Creemers, Marc R. Lambrecht
Publication date: 18 March 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.10.006
90B15: Stochastic network models in operations research
90C40: Markov and semi-Markov decision processes
Related Items
Uses Software
Cites Work
- Unnamed Item
- Scheduling projects with stochastic activity duration to maximize expected net present value
- On the generation of circuits and minimal forbidden sets
- Iterative algorithms for generating minimal cutsets in directed graphs
- A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
- Activity Delay in Stochastic Project Networks
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Preselective strategies for the optimization of stochastic project networks under resource constraints
- A computational study on bounding the makespan distribution in stochastic project networks