SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Distribution function of the shortest path in networks of queues
6 references·3 citing·27 second hop
Distribution function of the shortest path in networks of queues (2004)Distribution function of the shortest pat…The Fastest Path through a Network with Random Time-Dependent Travel Times (1986)The Fastest Path through a Ne…The use of cutsets in Monte Carlo analysis of stochastic networks (1979)The use of cutsets in Monte C…Fundamentals of Queueing Theory. (1977)Fundamentals of Queueing Theo…Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis (1971)Conditional Monte Carlo: A Si…Bounding Distributions for a Stochastic Acyclic Network (1971)Bounding Distributions for a …Distribution of the Time Through a Directed, Acyclic Network (1965)Distribution of the Time Thro…Multi-objective time–cost trade-off in dynamic PERT networks using an interactive approach (2006)Multi-objective time–cost tra…Longest path analysis in networks of queues: Dynamic scheduling problems (2005)Longest path analysis in netw…A multi-objective lead time control problem in multistage assembly systems using an interactive method (2005)A multi-objective lead time c…Multiple Objective Decision Making — Methods and Applications (1979)Markov and Markov-Regenerative pert Networks (1986)Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines (1996)Application of a Technique for Research and Development Program Evaluation (1959)Critical-Path Planning and Scheduling: Mathematical Basis (1961)An Analytical Study of the PERT Assumptions (1964)Bounding the Project Completion Time Distribution in PERT Networks (1985)Six decades of project management research: Thematic trends and future opportunities (2016)Expected Critical Path Lengths in PERT Networks (1962)MONTE CARLO METHODS AND THE PERT PROBLEM (1963)Bounding distributions for a stochastic pert network (1977)Stochastic and Fuzzy Pert (1997)On criticality and sensitivity in activity networks (2000)Letter to the Editor—Monte Carlo Methods and the PERT Problem (1963)Activity networks: Project planning and control by network models (1977)Approximating the Criticality Indices of the Activities in PERT Networks (1985)Activity Delay in Stochastic Project Networks (1997)Sensitivity analysis in PERT networks: Does activity duration distribution matter? (2016)Fundamentals of Queueing Theory. (1986)Expected shortest paths in dynamic and stochastic traffic networks (1998)Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (2000)Shortest path problem considering on-time arrival probability (2009)Intuition and Rationality in MCDM (2015)Multi-objective integrated optimization study of prefabricated building projects introducing sustainable levels (2023)Input Versus Output Queueing on a Space-Division Packet Switch (1987)Queueing analysis: A foundation of performance evaluation (1995)Modeling bursts and heavy tails in human dynamics (2006)
this work references cited by second hop

References

  • 1977Fundamentals of Queueing Theory.2,930 cited
  • 1986The Fastest Path through a Network with Random Time-Dependent Travel Times404 cited
  • 1965Distribution of the Time Through a Directed, Acyclic Network221 cited
  • 1971Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis153 cited
  • 1971Bounding Distributions for a Stochastic Acyclic Network132 cited
  • 1979The use of cutsets in Monte Carlo analysis of stochastic networks95 cited

Cited by

  • 2006Multi-objective time–cost trade-off in dynamic PERT networks using an interactive approach48 cited
  • 2005Longest path analysis in networks of queues: Dynamic scheduling problems20 cited
  • 2005A multi-objective lead time control problem in multistage assembly systems using an interactive method17 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work