An optimization model for stochastic project networks with cash flows
From MaRDI portal
Publication:867428
DOI10.1007/s10287-006-0018-8zbMath1136.90009OpenAlexW2089299992MaRDI QIDQ867428
Publication date: 15 February 2007
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-006-0018-8
Stochastic programming (90C15) Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Project planning with alternative technologies in uncertain environments ⋮ Maximizing the expected net present value in a project with uncertain cash flows ⋮ 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 ⋮ Scheduling projects with stochastic activity duration to maximize expected net present value
Cites Work
- Unnamed Item
- The scheduling of activities to maximize the net present value of projects
- Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
- Project network models with discounted cash flows a guided tour through recent developments
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Scheduling a project to maximize its net present value: An integer programming approach
- Computing the probability distribution of project duration in a PERT network
- Bounding the Project Completion Time Distribution in PERT Networks
- Stochastic Network Programming for Financial Planning Problems
- Technical Note—Expected Completion Time in Pert Networks
- Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
- Activity Delay in Stochastic Project Networks
- Expected Critical Path Lengths in PERT Networks
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- On the Expected Duration of PERT Type Networks
- Bounding Distributions for a Stochastic Acyclic Network
- The payment scheduling problem