Nonpreemptive Multi-Server Priority Queues

Unknown author

16 citations0/0 files storedJournal of the Operational Research Society

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 Statistical Research Age of Information Optimization

Abstract

Hokstad recently published an approximate method for calculating the behaviour of an M/G/m queue. This note applies his results to the nonpreemptive priority situation with two priority classes having the same service-time distribution. Laplace transforms and the first two moments of the waiting-time distributions are given.

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 — 16 citations exist upstream.

References

1954Priority Assignment in Waiting Line Problems 1970Inequalities in the Theory of Queues 1978Approximations in finite-capacity multi-server queues by Poisson arrivals 1978Approximations for the M/G/m Queue 1959Queueing Processes Associated with Airline Passenger Check-in 1971Some Inequalities for Parallel-Server Queues 1976Some Approximate Equilibrium Results for the Multi-Server Queue (M/G/r)*1979Heavy traffic theory for queues with several servers. II

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.