Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-22T14:00:55.706Z Has data issue: false hasContentIssue false
  • English
  • Français

ANALYSIS OF A CLEARING QUEUEING SYSTEM WITH SERVER MAINTENANCE AFTER N NEGATIVE FEEDBACKS

Published online by Cambridge University Press:  16 April 2018

Tao Jiang
Tao Jiang*
Affiliation:
College of Economics and Management, Shandong University of Science and Technology, Qingdao 266590, People's Republic of China E-mails: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper is devoted to the study of a clearing queueing system with a special discipline. As soon as the server receives N negative feedbacks from customers, all present customers are forced to leave the system and the server undergoes a maintenance procedure. After an exponential maintenance time, the system resumes its service immediately. Using the matrix analytic method, we derive the steady-state distributions, which are then used for the computation of other performance measures. Furthermore, using first step analysis, we obtain the Laplace–Stieltjes transform of the sojourn time of an arbitrary customer. We also study the busy period of the system and derive the generating function of the total number of lost customers in a busy period. Finally, we investigate a long-run rate of cost and explore the optimal N value that minimizes the total cost per unit time. We also present some numerical examples to illustrate the impact of several model parameters to the performance measures.

Keywords

busy periodclearing queuematrix analytic approachnegative feedbacksojourn time
Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 33 , Issue 2 , April 2019 , pp. 220 - 240
Copyright
Copyright © Cambridge University Press 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Artalejo, J.R. & Gómez-Corral, A. (1998). Analysis of a stochastic clearing system with repeated attempts. Communications in Statistics: Stochastic Models 14: 623–645.Google Scholar
2.Boudali, O. & Economou, A. (2012). Optimal and equilibrium balking strategies in the single server Markovian queue with catastrophes. European Journal of Operational Research 218: 708–715.Google Scholar
3.Boudali, O. & Economou, A. (2013). The effect of catastrophes on the strategic customer behavior in queueing systems. Naval Research Logistics 60: 571–587.Google Scholar
4.Chakravarthy, S.R. (2009). A disaster queue with Markovian arrivals and impatient customers. Applied Mathematics and Computation 214: 48–59.Google Scholar
5.Dimou, S. & Economou, A. (2013). The single server queue with catastrophes and geometric reneging. Methodology and Computing in Applied Probability 15(3): 595–621.Google Scholar
6.Dimou, S., Economou, A. & Fakinos, D. (2011). The single server vacation queueing model with geometric abandonments. Journal of Statistical Planning and Inference 141: 2863–2877.Google Scholar
7.Economou, A. & Manou, A. (2013). Equilibrium balking strategies for a clearing system in alternating environment. Annals of Operations Research 208: 489–514.Google Scholar
8.Giorno, V., Nobile, A.G. & Spina, S. (2014). On some time non-homogeneous queueing systems with catastrophes. Applied Mathematics and Computation 245: 220–234.Google Scholar
9.Jiang, T. & Liu, L. (2015). The GI/M/1 queue in a multi-phase service environment with disasters and working breakdowns. International Journal of Computer Mathematics 94(4): 707–726.Google Scholar
10.Jiang, T. & Liu, L. (2016). Analysis of a GI/M/1 queue in a multi-phase service environment with disasters. RAIRO-Operations Research 51: 79–100.Google Scholar
11.Jiang, T., Liu, L. & Li, J. (2015). Analysis of the M/G/1 queue in multi-phase random environment with disasters. Journal of Mathematical Analysis and Applications 430: 857–873.Google Scholar
12.Kapodistria, S., Phung-Duc, T. & Resing, J. (2016). Linear birth/immigration-death process with binomial catastrophes. Probability in the Engineering and Informational Sciences 30(1): 79–111.Google Scholar
13.Kim, B.K. & Lee, D.H. (2014). The M/G/1 queue with disasters and working breakdowns. Applied Mathematical Modelling 38: 1788–1798.Google Scholar
14.Mytalas, G.C. & Zazanis, M.A. (2015). An MX/G/1 queueing system with disasters and repairs under a multiple adapted vacation policy. Naval Research Logistics 62: 171–189.Google Scholar
15.Neuts, M.F. (1981). Matrix geometric solutions in stochastic models-an algorithmic approach. Baltimore and London: The Johns Hopkins University Press.Google Scholar
16.Paz, N. & Yechiali, U. (2014). An M/M/1 queue in random environment with disasters. Asia-Pacifc Journal of Operational Research 31(3), Article 1450016, 12 pages.Google Scholar
17.Phung-Duc, T. (2017). Exact solutions for M/M/c/setup queues. Telecommunication Systems 64(2): 309–324.Google Scholar
18.Stidham, S. (1974). Stochastic clearing systems. Stochastic Processes and their Applications 2: 85–113.Google Scholar
19.Sudhesh, R. (2010). Transient analysis of a queue with system disasters and customer impatience. Queueing Systems 66: 95–105.Google Scholar
20.Sudhesh, R., Sebasthi Priya, R., & Lenin, R.B. (2016). Analysis of N-policy queues with disastrous breakdown. TOP 24: 612–634.Google Scholar
21.Van Houdt, B. & van Leeuwaarden, J.S.H. (2011). Triangular M/G/1-type and tree-like QBD Markov chains. INFORMS Journal on Computing 23(1): 165–171.Google Scholar
22.Yang, W.S., Kim, J.D., & Chae, K.C. (2002). Analysis of M/G/1 stochastic clearing systems. Stochastic Analysis and Applications 20: 1083–1100.Google Scholar
23.Yechiali, U. (2007). Queues with system disasters and impatient customers when system is down. Queueing Systems 56: 195–202.Google Scholar
24.Zhou, W., Zheng, Z. & Xie, W. (2017). A control-chart-based queueing approach for service facility maintenance with energy-delay tradeoff. European Journal of Operational Research 261: 613–625.Google Scholar