Critical path planning under uncertainty

DOI10.1007/BFB0121082MaRDI QIDQ3706870zbMATH OpenOpenAlexFDO

Authors Richard D. Wollmer

Publication date 1985

Published in Mathematical Programming Essays in Honor of George B. Dantzig Part II (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0121082

zbMATH Keywords

CPM networkcritical pathcutting plane techniqueexpected project completion timeminimum investmentrandom job timessequence of longest path problems in an acyclic network

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Stochastic programming (90C15) Programming involving graphs or networks (90C35)

Recommendations

• Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach
• Risk taking in stochastic PERT networks
• The Most Critical Path in a PERT Network
• scientific article; zbMATH DE number 3876907
• Critical Path Analyses Via Chance Constrained and Stochastic Programming

Cited in

(21)

• Bounding the expected time-cost curve for a stochastic PERT network from below
• A classified bibliography of recent research relating to project risk management
• Sample-path optimization of convex stochastic performance functions
• Improving project cost estimation by taking into account managerial flexibility
• Project scheduling under uncertainty: survey and research potentials
• Expectation and chance-constrained models and algorithms for insuring critical paths
• scientific article; zbMATH DE number 3876907 (Why is no real title available?)
• An adaptive crashing policy for stochastic time-cost tradeoff problems
• Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Time-cost trade-off analysis of project networks in fuzzy environments
• Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach
• Modeling stochastic project time-cost trade-offs with time-dependent activity durations
• scientific article; zbMATH DE number 1996472 (Why is no real title available?)
• Project management in a competitive environment: interdicting a CPM based project and its implications
• The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights
• Project bidding under deterministic and probabilistic activity durations
• Optimization models and a GA-based algorithm for stochastic time-cost trade-off problem
• Using a risk-based approach to project scheduling: a case illustration from semiconductor manufacturing
• A heuristic procedure for solving the dynamic probabilistic project expediting problem
• New fuzzy models for time-cost trade-off problem
• A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations

This page was built for publication: Critical path planning under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706870)