M/G/1 queueing systems with returning customers

DOI10.2307/3214325MaRDI QIDQ3825897zbMATH OpenOpenAlexFDO

Authors Betsy S. Greenberg

Publication date 1989

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3214325

zbMATH Keywords

customers see time averagesserver utilizationSystem performance measures

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• An upper bound on the performance of queues with returning customers
• The \(M/G/1\) retrial queue with nonpersistent customers
• A queueing system with returning customers and waiting line
• An M/G/1 retrial queue with recurrent customers and general retrial times
• Explicit Formulae for the Characteristics of the M/H₂/1 Retrial Queue

Cited in

(11)

• Information theoretic approximations for the \(M/G/1\) retrial queue
• A retrial queue with redundancy and unreliable server
• Asymptotic bounds for an optimal state-dependent retrial rate of the \(M/M/1\) queue with returning customers.
• A queueing system with returning customers and waiting line
• Approximations for multiserver queues with balking/retrial discipline
• An upper bound on the performance of queues with returning customers
• Timing it right: balancing inpatient congestion vs. readmission risk at discharge
• AnM|G|1 Retrial Queue with Nonpersistent Customers and Orbital Search
• Recurrent retrial queues with service options on arrival
• The M/G/1 retrial queue with Bernoulli schedule
• A survey of retrial queues

This page was built for publication: M/G/1 queueing systems with returning customers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3825897)