Interpolation Approximations of Sojourn Time Distributions
From MaRDI portal
Publication:3353933
DOI10.1287/OPRE.39.2.251zbMATH Open0729.60099OpenAlexW2139441731MaRDI QIDQ3353933FDOQ3353933
Authors: Philip Fleming, Burton Simon
Publication date: 1991
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.2.251
Recommendations
- Simterpolation: A Simulation based Interpolation Approximation for Queueing Systems
- An Interpolation Approximation for Queueing Systems with Poisson Input
- A Simple Relationship Between Light and Heavy Traffic Limits
- Calculating light traffic limits for sojourn times in open markovian queueing systems
- Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (10)
- Transient flows in queueing systems via closure approximations
- A Simple Relationship Between Light and Heavy Traffic Limits
- Approximation of sojourn-times via maximal couplings: motif frequency distributions
- Title not available (Why is that?)
- A network of priority queues in heavy traffic: One bottleneck station
- A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks
- An Interpolation Approximation for Queueing Systems with Poisson Input
- An explicit estimate of sojourning time by intermittency with elementary method
- An interpolation approximation for expected wait in a time-limited polling system
- Simterpolation: A Simulation based Interpolation Approximation for Queueing Systems
This page was built for publication: Interpolation Approximations of Sojourn Time Distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353933)