Name
Abstract | ||
|---|---|---|
This paper discusses a class of M/M/1 queueing models in which the service time of a customer depends on the number of customers served in the current busy period. It is particularly suited for applications in which the server has kind of learning ability and warms up gradually. We present a simple and computationally tractable scheme which recursively determines the stationary probabilities of the queue length. Other performance measures such as the Laplace transform of the busy period are also obtained. For the firstN exceptional services model which can be considered as a special case of our model, we derive a closed-formula for the generating function of the stationary queue length distribution. Numerical examples are also provided. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BF01149078 | Queueing Systems - Theory and Applications |
Keywords | Field | DocType |
queueing model,varying service rates,queue length distribution,busy period | M/M/1 queue,D/M/1 queue,M/D/1 queue,Mathematical optimization,Bulk queue,M/M/c queue,Computer science,M/G/1 queue,M/G/k queue,Real-time computing,M/M/∞ queue | Journal |
Volume | Issue | ISSN |
24 | 1-4 | 0257-0130 |
Citations | PageRank | References |
2 | 0.66 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huan Li | 1 | 2 | 0.66 |
| Yixin Zhu | 2 | 74 | 13.74 |
| Ping Yang | 3 | 52 | 10.62 |
| Seshu Madhavapeddy | 4 | 112 | 10.77 |