Performance analysis of an M/G/1 queue with bi-level randomized (p, N1, N2)-policy

Kuang, Xinyu; Tang, Yinghui; Yu, Miaomiao; Wu, Wenqing

doi:10.1051/ro/2022008

Performance analysis of an M/G/1 queue with bi-level randomized (p, N₁, N₂)-policy

Kuang, Xinyu ; Tang, Yinghui ; Yu, Miaomiao ; Wu, Wenqing

RAIRO. Operations Research, Tome 56 (2022) no. 1, pp. 395-414

Résumé

This paper proposes an M/G/1 queueing model with bi-level randomized (p, N₁, N₂)-policy. That is, after all of the customers in the system are served, the server is closed down immediately. If N₁(≥ 1) customers are accumulated in the queue, the server is activated for service with probability p(0 ≤ p ≤ 1) or still left off with probability 1 − p. When the number of customers in the system becomes N₂(≥ N₁), the server begins serving the waiting customers until the system becomes empty again. Using the total probability decomposition technique and the Laplace transform, we study the transient queue length distribution and obtain the expressions of the Laplace transform of the transient queue-length distribution with respect to time t. Then, employing L’Hospital’s rule and some algebraic operations, the explicit recursive formulas of the steady-state queue-length distribution, which can be used to accurately evaluate the probabilities of queue length, are presented. Moreover, some other important queuing performance indices, such as the explicit expressions of its probability generating function of the steady-state queue-length distribution, the expected queue size and so on, are derived. Meanwhile, we investigate the system capacity optimization design by the steady-state queue-length distribution. Finally, an operating cost function is constructed, and by numerical calculation, we find the minimum of the long-run average cost rate and the optimal bi-level threshold policy (N^*₁,N^*₂) that satisfies the average waiting time constraints.

MR Zbl

DOI : 10.1051/ro/2022008

Classification : 60K25, 68M20, 90B22
Keywords: $$/$$/1 queue, ($$_1, $$₂)-policy, queue-length distribution, capacity optimization design, cost optimization

@article{RO_2022__56_1_395_0,
     author = {Kuang, Xinyu and Tang, Yinghui and Yu, Miaomiao and Wu, Wenqing},
     title = {Performance analysis of an {\protect\emph{M}/\protect\emph{G}/1} queue with bi-level randomized (\protect\emph{p}, {\protect\emph{N}\protect\textsubscript{1},} {\protect\emph{N}\protect\textsubscript{2})-policy}},
     journal = {RAIRO. Operations Research},
     pages = {395--414},
     year = {2022},
     publisher = {EDP-Sciences},
     volume = {56},
     number = {1},
     doi = {10.1051/ro/2022008},
     mrnumber = {4378551},
     zbl = {1497.60126},
     language = {en},
     url = {https://www.numdam.org/articles/10.1051/ro/2022008/}
}

TY  - JOUR
AU  - Kuang, Xinyu
AU  - Tang, Yinghui
AU  - Yu, Miaomiao
AU  - Wu, Wenqing
TI  - Performance analysis of an M/G/1 queue with bi-level randomized (p, N1, N2)-policy
JO  - RAIRO. Operations Research
PY  - 2022
SP  - 395
EP  - 414
VL  - 56
IS  - 1
PB  - EDP-Sciences
UR  - https://www.numdam.org/articles/10.1051/ro/2022008/
DO  - 10.1051/ro/2022008
LA  - en
ID  - RO_2022__56_1_395_0
ER  -

%0 Journal Article
%A Kuang, Xinyu
%A Tang, Yinghui
%A Yu, Miaomiao
%A Wu, Wenqing
%T Performance analysis of an M/G/1 queue with bi-level randomized (p, N1, N2)-policy
%J RAIRO. Operations Research
%D 2022
%P 395-414
%V 56
%N 1
%I EDP-Sciences
%U https://www.numdam.org/articles/10.1051/ro/2022008/
%R 10.1051/ro/2022008
%G en
%F RO_2022__56_1_395_0

Kuang, Xinyu; Tang, Yinghui; Yu, Miaomiao; Wu, Wenqing. Performance analysis of an M/G/1 queue with bi-level randomized (p, N₁, N₂)-policy. RAIRO. Operations Research, Tome 56 (2022) no. 1, pp. 395-414. doi: 10.1051/ro/2022008

Bibliographie
Cité par

[1] K. R. Balachandran, Control policies for a single server system. Manag. Sci. 19 (1973) 1013–1018. | MR | Zbl | DOI

[2] E. A. Feinberg and D. J. Kim, Bicriterion optimization of an $M / G / 1$ queue with a removable server. Probab. Eng. Inf. Sci. 10 (1996) 57–73. | MR | Zbl | DOI

[3] J. X. Gu, Y. Y. Wei, Y. H. Tang and M. M. Yu, Queue size distribution of $G e o / G / 1$ queue under the $M i n (N, D)$ -policy. J. Syst. Sci. Complexity 29 (2016) 752–771. | MR | Zbl | DOI

[4] D. P. Heyman, $N$ -policy for the $M / G / 1$ queue. Manag. Sci. 23 (1977) 775–778. | Zbl | DOI

[5] M. Jain and S. Kaur, $(p, N)$ -policy for unreliable server bulk queue with Bernoulli feedback. Int. J. Appl. Comput. Math. 6 (2020) 170–198. | MR | Zbl | DOI

[6] S. F. Jia and Y. H. Chen, The Geo/G/1 queue model with (p, N)-policy set-up time, multiple vacation and disasters. Int. J. Sci. Eng. Technol. 2 (2013) 991–995.

[7] F. C. Jiang, D. C. Huang, C. T. Yang, C. H. Lin and K. H. Wang, Design strategy for optimizing power consumption of sensor node with $M i n (N, T)$ -policy $M / G / 1$ queuing models. Int. J. Commun. Syst. 25 (2012) 652–671. | DOI

[8] J. C. Ke, Bi-level control for batch arrival queues with an early startup and unreliable server. Appl. Math. Model. 28 (2004) 469–485. | Zbl | DOI

[9] S. J. Lan and Y. H. Tang, The structure of departure process and optimal control strategy N* for Geo/G/1 discrete-time queue with multiple server vacations and Min(N, V)-policy. J. Syst. Sci. Complexity 30 (2017) 1382–1402. | MR | Zbl | DOI

[10] S. J. Lan and Y. H. Tang, Performance and reliability analysis of a repairable discrete-time Geo/G/1 queue with Bernoulli feedback and randomized policy. Appl. Stoch Model. Bus. 33 (2017) 522–543. | MR | Zbl | DOI

[11] S. J. Lan and Y. H. Tang, Analysis of $D$ -policy discrete-time $Geo / G / 1$ queue with second $J$ -optional service and unreliable server. RAIRO-Oper. Res. 51 (2017) 101–122. | MR | Zbl | Numdam | DOI

[12] H. W. Lee and J. G. Park, Optimal strategy in $N$ -policy production system with early set-up. J. Oper. Res. Soc. 48 (1997) 306–313. | Zbl | DOI

[13] H. W. Lee and W. J. Seo, The performance of the $M / G / 1$ queue under the dyadic $M i n (N, D)$ -policy and its cost optimization. Perform. Eval. 65 (2008) 742–758. | DOI

[14] H. W. Lee, N. I. Park and J. Jeon, Queue length analysis of batch arrival queues under bi-level threshold control with early set-up. Int. J. Syst. Sci. 34 (2003) 195–204. | MR | Zbl | DOI

[15] H. W. Lee, W. J. Seo, S. W. Lee and J. Jeon, Analysis of the $MAP / G / 1$ queue under the $M i n (N, D)$ -policy. Stoch. Models 26 (2010) 98–123. | MR | Zbl | DOI

[16] J. Li, L. W. Liu, On an $M / G / 1$ queue in random environment with $M i n (N, V)$ policy. RAIRO-Oper. Res. 52 (2018) 61–77. | MR | Zbl | Numdam | DOI

[17] C. Y. Luo, Y. H. Tang and K. Z. Yu, Optimal $(r, N)$ -policy for discrete-time $Geo / G / 1$ queue with different input rate and setup time. Appl. Stoch. Model. Bus. 31 (2015) 405–423. | MR | Zbl | DOI

[18] Y. H. Tang and X. W. Tang, Queuing Theory-Foundations and Analysis Techniques. Science Press, Beijing (2006) (in Chinese).

[19] Y. H. Tang, W. Q. Wu, Y. P. Liu and X. Y. Liu, The queue length distribution of M/G/1 queuing system with Min(N, V)-policy based on multiple server vacations. Syst. Eng-Theor. Practice 34 (2014) 1533–1546. (in Chinese).

[20] J. Teghem, Control of the service process in a queuing system. Eur. J. Oper. Res. 23 (1986) 141–158. | MR | Zbl | DOI

[21] N. S. Tian, Stochastic Service System with Vacations. Peking University Press, Beijing (2001) (in Chinese).

[22] K. H. Wang and K. B. Huang, A maximum entropy approach for the $(p, N)$ -policy $M / G / 1$ queue with a removable and unreliable server. Appl. Math. Model. 33 (2009) 2024–2034. | MR | Zbl | DOI

[23] T. Y. Wang and J. C. Ke, The randomized threshold for the discrete-time $G e o / G / 1$ queue. Appl. Math. Model. 33 (2009) 3178–3185. | Zbl | DOI

[24] Y. Y. Wei, Y. H. Tang and M. M. Yu, Recursive solution of queue length distribution for Geo/G/1 queue with delayed Min(N, D)-Policy. J. Syst. Sci. Inf. 4 (2020) 1478–9906.

[25] D. Y. Yang and J. C. Ke, Cost optimization of a repairable $M / G / 1$ queue with a randomized policy and single vacation. Appl. Math. Model. 38 (2014) 5113–5125. | MR | Zbl | DOI

[26] M. Yadin and P. Naor, Queuing systems with a removable service station. Oper. Res. Q. 14 (1963) 393–405. | DOI

Cité par Sources :