Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis

From MaRDI portal
Publication:5635240

DOI10.1287/mnsc.18.3.207zbMath0227.90020OpenAlexW2076092908MaRDI QIDQ5635240

Mark B. Garman, John M. Jun. Burt

Publication date: 1971

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.18.3.207



Related Items

Approximating the distribution functions in stochastic networks, Risk taking in stochastic PERT networks, A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, Optimal crashing of an activity network with disruptions, Longest path analysis in networks of queues: dynamic scheduling problems, A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network, Stochastic activity networks: a four-parameter approach for completion times, A perspective on variance reduction in dynamic simulation experiments, On the measurement of complexity in activity networks, A factoring approach for the stochastic shortest path problem, A new approximation algorithm for obtaining the probability distribution function for project completion time, A heuristic procedure for solving the dynamic probabilistic project expediting problem, Time-cost trade-off via optimal control theory in Markov PERT networks, A multi-objective resource allocation problem in PERT networks, A Monte Carlo Technique with Quasirandom Points for the Stochastic Shortest Path Problem, Stochastic networks and the extreme value distribution, Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation, Resource-constrained project scheduling: Notation, classification, models, and methods, A general simulation methodology for optical bar code evaluation, Estimating the distribution function of a transformed random vector, The use of cutsets in Monte Carlo analysis of stochastic networks, Stochastic and fuzzy PERT, Reducing Simulation Input-Model Risk via Input Model Averaging, The most likely path on series-parallel networks