Distribution of the Time Through a Directed, Acyclic Network
From MaRDI portal
Cited in
(47)- Due date assignment for multistage assembly systems
- Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
- Probabilistic shortest path problems with budgetary constraints
- A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network
- A factoring approach for the stochastic shortest path problem
- The expected length of a shortest path
- The most critical path in a PERT network: A heuristic approach
- On criticality and sensitivity in activity networks
- Selective influence and response time cumulative distribution functions in serial-parallel task networks.
- Computing project makespan distributions: Markovian PERT networks revisited
- A new approach to determine the critical path in stochastic activity network
- Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation
- Stochastic and fuzzy PERT
- The bias of an estimate of coupled slack in stochastic PERT networks
- Path critical index and activity critical index in PERT networks
- A new structural mechanism for reducibility of stochastic PERT networks
- Optimal control of service rates and arrivals in Jackson networks
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Using schedule risk analysis with resource constraints for project control
- Project risk management from the bottom-up: activity risk index
- Using earned value management and schedule risk analysis with resource constraints for project control
- Risk taking in stochastic PERT networks
- Reliability function of a class of time-dependent systems with standby redundancy
- Adjustment of the moments of the project completion times when activity times are exponentially distributed
- Finding the shortest path in stochastic networks
- A new approximation algorithm for obtaining the probability distribution function for project completion time
- Lower bound for the mean project completion time in dynamic PERT networks
- Time-cost trade-off via optimal control theory in Markov PERT networks
- A multi-objective resource allocation problem in PERT networks
- Global optima results for the Kauffman \(NK\) model
- Evolutionary algorithms for multi-objective stochastic resource availability cost problem
- Risk-averse shortest path interdiction
- Berechnung stochastischer Termine
- scientific article; zbMATH DE number 3841590 (Why is no real title available?)
- Some remarks on the expected delay of project duration in a PERT network
- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
- A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration
- Estimating the distribution function of a transformed random vector
- A new probabilistic approach to the path criticality in stochastic PERT
- Stochastic networks and the extreme value distribution
- The exact overall time distribution of a project with uncertain task durations
- On computing the distribution function of the sum of independent random variables
- Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams
- The use of cutsets in Monte Carlo analysis of stochastic networks
- Longest path analysis in networks of queues: dynamic scheduling problems
- Modelling complex assemblies as a queueing network for lead time control
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
This page was built for publication: Distribution of the Time Through a Directed, Acyclic Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5511895)
