Name
Abstract | ||
|---|---|---|
In this paper, we introduce the multiple adaptive vacation policy and the general decrementing service rule based on the classical M/G/1 queueing systems, and obtain the P.G.F. (Probability Generating Function) of stationary queue length by using the embedded Markov chain method and regeneration cycle approach. Then, the LST (Laplace Stieltjes Transform) of stationary waiting time is also derived according to the independence between the waiting time and arrival process. At last some special cases are given to show the general properties of the new model, and some numerical results are shown to compare the mean queue length and waiting time of special cases. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.amc.2008.07.004 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Multiple adaptive vacation,General decrementing service,Embedded Markov chain method,Regeneration cycle approach,Additional queue length | M/M/1 queue,Applied mathematics,Mathematical optimization,Combinatorics,G/G/1 queue,Bulk queue,M/M/c queue,M/G/1 queue,M/G/k queue,Queueing theory,Pollaczek–Khinchine formula,Mathematics | Journal |
Volume | Issue | ISSN |
204 | 1 | 0096-3003 |
Citations | PageRank | References |
1 | 0.36 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhanyou Ma | 1 | 1 | 1.37 |
| Qingzhen Xu | 2 | 26 | 4.69 |