A heuristic procedure for solving the dynamic probabilistic project expediting problem
From MaRDI portal
Publication:948658
DOI10.1016/j.ejor.2007.09.010zbMath1175.90081OpenAlexW2030702697MaRDI QIDQ948658
Publication date: 17 October 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.09.010
Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)
Related Items
An adaptive crashing policy for stochastic time-cost tradeoff problems ⋮ Dynamic expediting of an urgent order with uncertain progress ⋮ An order expediting policy for continuous review systems with manufacturing lead-time
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The use of cutsets in Monte Carlo analysis of stochastic networks
- The chance constrained critical path with location-scale distributions
- The discrete time-cost tradeoff problem revisited
- On the measurement of complexity in activity networks
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- On the use of the complexity index as a measure of complexity in activity networks
- Project scheduling. A research handbook.
- On criticality and sensitivity in activity networks
- Project scheduling under uncertainty: survey and research potentials
- Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation
- PERT and crashing revisited: Mathematical generalizations
- A Network Flow Computation for Project Cost Curves
- New computational results on the discrete time/cost trade-off problem in project networks
- Critical-Path Planning and Scheduling: Mathematical Basis
- Determining the K Most Critical Paths in PERT Networks
- Critical path planning under uncertainty
- Approximating the Criticality Indices of the Activities in PERT Networks
- Practical Use of Distributions in Network Analysis
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Coefficient of Network Complexity
- Note—A Note on “A Simple CPM Time-Cost Tradeoff Algorithm”
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- Project scheduling: The effects of problem structure on heuristic performance
- A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
- Measures of the restrictiveness of project networks
- Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
- A Dynamic Programming Algorithm for Decision CPM Networks
- Mersenne twister
- An uncertainty importance measure of activities in PERT networks
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Algorithm 708: Significant digit computation of the incomplete beta function ratios
- Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach
- A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
- Project Management Duration/Resource Tradeoff Analysis: an Application of the Cut Search Approach
- Efficient Estimation of Arc Criticalities in Stochastic Activity Networks
- Twisted GFSR generators II
- Twisted GFSR generators
- Application of a Technique for Research and Development Program Evaluation
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- Distribution of the Time Through a Directed, Acyclic Network
- On the Expected Duration of PERT Type Networks
- Optimum Time Compression in Project Scheduling
- A Simple CPM Time-Cost Tradeoff Algorithm
- Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
- Chance-constrained programming in activity networks: A critical evaluation
