On the number of customers lost in a finite state-dependent queue.
From MaRDI portal
Publication:2468561
DOI10.1007/BF03398530zbMath1141.60380OpenAlexW2772503358MaRDI QIDQ2468561
William J. Gray, MecKinley Scott, Pu Patrick Wang
Publication date: 25 January 2008
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398530
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition of the M/M/1 transition function
- The transient solution to a class of Markovian queues
- Markov chain models - rarity and exponentiality
- First-passage-time and busy-period distributions of discrete-time Markovian queues: \(\text{Geom}(n)/\text{Geom}(n)/1/N\)
- On the transient behavior of a finite birth-death process with an application
- Approximating Transition Probabilities and Mean Occupation Times in Continuous-Time Markov Chains
This page was built for publication: On the number of customers lost in a finite state-dependent queue.