An M/G/c queue in which the number of servers required is random

Awi Federgruen · Linda Green

24 citations0/0 files storedJournal of Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Risk Models Age of Information Optimization

Abstract

Many queueing situations such as computer, communications and emergency systems have the feature that customers may require service from several servers at the same time. They may thus be delayed until the required number of servers is available and servers may be idle when customers are waiting. We consider general server-completion-time distributions and derive approximation methods for the computation of the steady-state distribution of the number of customers in queue as well as the moments of the waiting-time distribution. Extensive computational results are reported.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 24 citations exist upstream.

References

1984Matrix-Geometric Solutions to Stochastic Models 1963Introduction to the Theory of Queues.1985Matrix-geometric solutions in stochastic models 1982Approximating a Point Process by a Renewal Process, I: Two Basic Methods 1972Urban Police Patrol Analysis 1978Approximations in finite-capacity multi-server queues by Poisson arrivals 1972Regenerative processes in the theory of queues, with applications to the alternating-priority queue 1981Approximations for the steady-state probabilities in theM/G/cqueue

Cited by

1993Scheduling and stability aspects of a general class of parallel processing systems 1989Blocking of finite source inputs which require simultaneous servers with general think and holding times 1996Computation and optimization methods for multiresource queues

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.