Comparison conjectures about the M/G/s queue
From MaRDI portal
Publication:595276
DOI10.1016/0167-6377(83)90026-3zbMATH Open0527.60085OpenAlexW2084052765WikidataQ122977807 ScholiaQ122977807MaRDI QIDQ595276FDOQ595276
Publication date: 1983
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(83)90026-3
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparing counting processes and queues
- Poisson Arrivals See Time Averages
- Heavy traffic theory for queues with several servers. I
- On the Theory of Queues With Many Servers
- The queue GI/M/s with customers of different types or the queue GI/Hm/s
- A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS
- Some comparability results for waiting times in single- and many-server queues
- The effect of variability in the GI/G/s queue
- The steady-state solution of the M/K2/m queue
- A Light-Traffic Theorem for Multi-Server Queues
- On the comparison of waiting times in tandem queues
- Technical Note—On the Comparison of Waiting Times in GI/G/1 Queues
- Average delay in queues with non-stationary Poisson arrivals
- Queues with non-stationary input stream: Ross's conjecture
- On queues with periodic Poisson input
- Simple derivations of the invariance relations and their applications
- Bounds for the Probability of Wait in M/G/s Queues
- STOCHASTIC ORDER RELATIONS AMONG GI/G/1 QUEUES WITH A COMMON TRAFFIC INTENSITY
- A formal approach to queueing processes in the steady state and their applications
- Monotonieeigenschaften der Kundenwartezeiten im Modell GI/G/1
- Tables for M/G/c queuing systems with phase-type service
Cited In (7)
- A Fluid-Diffusion-Hybrid Limiting Approximation for Priority Systems with Fast and Slow Customers
- Equivalence relations in the approximations for the \(M/G/s/s+r\) queue.
- On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
- Approximations for multi-server queues: System interpolations
- On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems
- An aggregation procedure for simulating manufacturing flow line models
- Bounds for the mean queue length of the \(M/K_ 2/m\) queue
This page was built for publication: Comparison conjectures about the M/G/s queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595276)
