Scheduling Markovian PERT networks to maximize the net present value: new results

DOI10.1016/j.orl.2018.01.010OpenAlexW2761986573MaRDI QIDQ2417109

Roel Leus, Ben Hermans

Publication date: 11 June 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/612747

zbMATH Keywords

project schedulingMarkov decision processnet present valuemonotone optimal policyexponentially distributed activity durations

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money

Cites Work

• Unnamed Item
• Scheduling projects with stochastic activity duration to maximize expected net present value
• Scheduling Markovian PERT networks to maximize the net present value
• Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
• Minimizing a Submodular Function on a Lattice
• Activity Delay in Stochastic Project Networks
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach

This page was built for publication: Scheduling Markovian PERT networks to maximize the net present value: new results