Maximizing the net present value of a project under uncertainty: activity delays and dynamic policies
From MaRDI portal
Publication:6572829
Cites work
- A perfect information lower bound for robust lot-sizing problems
- A steepest ascent approach to maximizing the net present value of projects
- Activity Delay in Stochastic Project Networks
- An optimization model for stochastic project networks with cash flows
- Application of a technique for research and development program evaluation
- Cash Flows in Networks
- Critical-Path Planning and Scheduling: Mathematical Basis
- Maximizing the expected net present value of a project with phase-type distributed activity durations: an efficient globally optimal solution procedure
- Maximizing the net present value of a project under uncertainty
- Minimizing the expected makespan of a project with stochastic activity durations under resource constraints
- Moments and distribution of the net present value of a serial project
- New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing
- New strategies for stochastic resource-constrained project scheduling
- Proactive policies for the stochastic resource-constrained project scheduling problem
- Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
- Scheduling Markovian PERT networks to maximize the net present value
- Scheduling Markovian PERT networks to maximize the net present value: new results
- Sharp Bounds on the Value of Perfect Information
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
- The payment scheduling problem
This page was built for publication: Maximizing the net present value of a project under uncertainty: activity delays and dynamic policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572829)
