Notes Approximate Explicit Formulae For The Average Queueing Time In The Processes (M/D/r) and (D/M/r)

DOI10.1080/03155986.1975.11731618zbMath0318.60078OpenAlexW2401962668MaRDI QIDQ4080537

George P. Cosmetatos

Publication date: 1975

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1975.11731618

Mathematics Subject Classification ID

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

Related Items (8)

Approximations for multi-server queues: System interpolations ⋮ A multi-station system for reducing congestion in high-variability queues ⋮ Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities. ⋮ Improved delivery policies for future drone-based delivery systems ⋮ A review of open queueing network models of manufacturing systems ⋮ Performance characterization of complex manufacturing systems with general distributions and job failures ⋮ Tables for M/G/c queuing systems with phase-type service ⋮ Bounds for the mean queue length of the \(M/K_ 2/m\) queue

This page was built for publication: Notes Approximate Explicit Formulae For The Average Queueing Time In The Processes (M/D/r) and (D/M/r)