On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes

DOI10.1287/opre.19.2.424zbMath0234.60107OpenAlexW2125874650MaRDI QIDQ5643408

No author found.

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1287/opre.19.2.424

Mathematics Subject Classification ID

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

Related Items (9)

A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\) ⋮ A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues ⋮ Computational analysis of M(n)/G/1/N queues with setup time ⋮ Analysis of finite-buffer state-dependent bulk queues ⋮ Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\) ⋮ UMVUEs and Bayes estimators for various performance measures on a Poisson queue with discouraged arrivals ⋮ Performance analysis of the single server queue with state-dependent service ⋮ Markovian queueing system with discouraged arrivals and self-regulatory servers ⋮ On a machine interference problem with several types of machines attended by a single repairman

This page was built for publication: On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes