Issue |
RAIRO-Oper. Res.
Volume 56, Number 1, January-February 2022
|
|
---|---|---|
Page(s) | 395 - 414 | |
DOI | https://doi.org/10.1051/ro/2022008 | |
Published online | 10 February 2022 |
Performance analysis of an M/G/1 queue with bi-level randomized (p, N1, N2)-policy
1
School of Mathematical Sciences, Sichuan Normal University, Chengdu 610068, Sichuan, P.R. China
2
School of Science, Southwest University of Science and Technology, Mianyang 621000, Sichuan, P.R. China
* Corresponding author: tangyh@sicnu.edu.cn
Received:
2
June
2021
Accepted:
11
January
2022
This paper proposes an M/G/1 queueing model with bi-level randomized (p, N1, N2)-policy. That is, after all of the customers in the system are served, the server is closed down immediately. If N1(≥ 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 N2(≥ N1), 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*1,N*2) that satisfies the average waiting time constraints.
Mathematics Subject Classification: 60K25 / 68M20 / 90B22
Key words: M/G/1 queue / (p, N1, N2)-policy / queue-length distribution / capacity optimization design / cost optimization
© The authors. Published by EDP Sciences, ROADEF, SMAI 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.