A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates

DOI10.1287/moor.3.1.10zbMath0397.60076OpenAlexW2133931547MaRDI QIDQ4181071

Shelby Brumelle

Publication date: 1978

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.3.1.10

zbMATH Keywords

Birth-Death ProcessesErlang Loss SystemProcessor Shared SystemsStationary Probability Distributions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (14)

Technical Note—Static Pricing: Universal Guarantees for Reusable Resources ⋮ An inventory model with discounts for omnichannel retailers of slow moving items ⋮ On the cycle maximum of birth-death processes and networks of queues ⋮ History of Queueing Theory in Canada Prior to 1980 ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Analysis of \(GI/ M/ n/ n\) queueing system with ordered entry and no waiting line ⋮ Duality between the Erlang loss system and a finite source queue ⋮ Duality between the \(M/G/s/s\) and \(GI/M/1/s/s\) queues ⋮ Simple modeling techniques for base-stock inventory systems with state dependent demand rates ⋮ Insensitivity of the mean field limit of loss systems under SQ(d) routeing ⋮ Computing the conditional entry-state distribution in Erlang loss systems ⋮ Stationary queuing systems with dependencies ⋮ An inventory model with unidirectional lateral transshipments

This page was built for publication: A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates