Name
Abstract | ||
|---|---|---|
We consider a state-dependent single-server queue with orbit. This is a versatile model for the study of service systems, where the server needs a non-negligible time to retrieve waiting customers every time he completes a service. This situation arises typically when the customers are not physically present at a system, but they have a remote access to it, as in a call center station, a communication node, etc. We introduce a probabilistic approach for the performance evaluation of this queueing system, that we refer to as the queueing and Markov chain decomposition approach. Moreover, we discuss the applicability of this approach for the performance evaluation of other non-Markovian service systems with state dependencies. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s11134-018-9582-1 | Queueing Systems |
Keywords | Field | DocType |
State-dependent queueing system,Orbit,Retrial queue,Non-negligible retrieval time,Steady-state distribution,Conditional sojourn time distributions,Variable arrival rate,Variable service speed,Queueing and Markov chain decomposition,60K25,90B22 | Orbit,Mathematical optimization,State dependent,Markov chain,Queue,M/G/1 queue,Queueing theory,Probabilistic logic,Mathematics,Retrial queue | Journal |
Volume | Issue | ISSN |
90 | 1-2 | 1572-9443 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Opher Baron | 1 | 145 | 14.64 |
| Antonis Economou | 2 | 237 | 20.53 |
| Athanasia Manou | 3 | 23 | 2.20 |