Project bidding under deterministic and probabilistic activity durations
From MaRDI portal
Recommendations
- A two-stage stochastic programming approach for project planning with uncertain activity durations
- Critical path planning under uncertainty
- Developing activity duration specification limits for effective project control
- Scheduling projects with stochastic activity duration to maximize expected net present value
- A competitive-bidding strategy
Cites work
- scientific article; zbMATH DE number 3599820 (Why is no real title available?)
- Application of a technique for research and development program evaluation
- Approximating the Criticality Indices of the Activities in PERT Networks
- Cash Flows in Networks
- Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
- The payment scheduling problem
- Unbalanced Highway Contract Tendering
Cited in
(10)- Simple probability models for project contracting
- A review of the contribution of operational research to project management
- An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem
- Neural network as a simulation metamodel in economic analysis of risky projects
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
- A comparison of stochastic scheduling rules for maximizing project net present value
- A classified bibliography of recent research relating to project risk management
- Activity nets: A guided tour through some recent developments
- Multi-period resource allocation for estimating project costs in competitive bidding
- Resource allocation for a stochastic CPM-type network through perturbation analysis
This page was built for publication: Project bidding under deterministic and probabilistic activity durations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721677)
