Abstract
In this paper we consider M/M/1queuing systems with server’s vacations and random breakdowns. Customers are impatient, where customers’ impatience is due to an absentee of the server upon arrival. This absentee is because either the server is on vacation or it is under repair. The mean number of customers in the system and the total waiting time the customer spends in the system have been derived in this work as a very common and important performance measures.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
1 Introduction
Queuing systems with server interruptions can be used in modeling numerous real-world queuing situations have arisen in systems such as manufacturing systems, communication systems, and production-inventory systems. There is now a growing interest in the analysis of queuing systems with impatient customers. This is due to the potential application of such systems in many related areas (cf. [1]).
Queuing systems with server vacations and/or random system breakdowns have been studied by numerous researchers, for instance, [2–4]. In their work [5–8] investigated a batch arrival queuing system with a Bernoulli scheduled vacation and random system breakdowns. In addition, [9] studied a queuing system with four different main server interruptions and a standby that ever replaces the main server during any potential stop.
The impatience phenomenon has been studied under various assumptions by many authors. The pioneering work of [10, 11] seems to be the first to analyze queuing systems with impatient customers by considering the unlimited buffer M/M/c queue and assuming that each individual customer stays in the queue as long as his waiting time does not exceed an exponentially distributed impatience time. Furthermore, [12] analyzed queuing systems with server vacations, where each arriving customer who finds no servers on duty because it is on vacation activates an independent random impatience timer. If a server does not show up by the time the timer expires, the customer abandons the queue.
In this work we study the queuing system where the customers’ impatience is due to the absence of servers upon arrival. This absence of the server is either because of the vacation or because of random breakdowns. If an arriving customer sees no server present in the system, he/she may abandon the queue if no server shows up within some time. Such a model, representing frequent behavior by waiting customers in service systems, has not been treated before in the literature.
2 The Model
The underlying process is a M/M/1 queue with multiple server ([12]). The customers arrive to the system according to a Poisson distribution with arrival rate λ. Service times are exponentially distributed with mean service rate. Also the vacation times are exponentially distributed with parameter γ. The system may breakdown at random, and breakdowns are assumed to occur according to a Poisson stream with mean breakdown rate α > 0. Once the system breaks down, the required repairs start immediately. The duration of repairs follows an exponential distribution with repair rate θ > 0.
We consider the impatience of a customer by noting that whenever a customer arrives to the system and realizes that the server is on vacation or under repair, he/she activates an “impatience timer” T, T which is exponentially distributed with parameter ξ. The impatience time T is independent of the queue size at that moment. If the server returns from his vacation before the time T expires (and starts providing service), the customer stays in the system until his/her service is completed. However, if T expires while the server is still on vacation or still under repairs, the customer leaves the queue, never to return.
3 Balance Equations
We start by letting L denote the total number of customers in the system, and we let J denote the number of working servers. When the server is on vacation or under repair, this means that J = 0, while J = 1 implies that the server is active. The pair (J, L) defines a continuous-time Markov process with transition-rate diagram as illustrated in Figure 1. Let \(Pjn = P\{J = j,L = n\}(j = 0,1;n = 0,1,2,\ldots )\) denote the (steady state) system state probabilities. The set of balance equations is given as
Define the probability generating functions (PGFs)
Then by multiplying each equation for n in equation (2) by z n, summing over n and rearranging terms, we get
In a similar manner from equation (1) we obtain
where \(G_{0}^{{\prime}}(z) = \frac{d} {dz}G_{0}(z)\). In the next section we will derive the mean number of customers in the system when the server works and the mean number of costumers when the server does not work.
4 Derivation of E(L 0) and E(L 1)
We begin by setting \(A = (\gamma +\theta )P_{00} +\mu P_{11}\). The probability that the server is working is defined by
From equation (3) we obtain
Clearly the probability that the server does not work (on vacation or under repair) is
Obviously \(P_{0\cdot } + P_{1\cdot } = 1\), so from equation (5) we get
Then
The mean number of customers in the system when the server does not work (on vacation or under repair) is given by \(E(L_{0}) = G_{0}^{{\prime}}(1) =\sum _{ n=0}^{\infty }nP_{0n}.\) So using L’Hospital’s rule on equation (4), we get
Implying that
To find the mean number of customers in the system when the server works \(E(L_{1}) = G_{0}^{{\prime}}\left (1\right )\), from equation (3), we get
Substituting the value of E(L 1) in equation (8) we get
Then
If we define S to be the total sojourn time of customers in the system, measured from the moment of arrival until departure, either after completion of service or as a result of abandonment. By little’s law
5 Conclusion
We have introduced and analyzed in this paper a new type of impatience behavior in which customers become impatient (and may leave the system) when the server goes on vacation or the server is broken down and under repair. This is in contrast with previously studied impatience behavior, which did not consider server breakdown and where customers may become impatient when the number of customers or the amount of workload queued in front of them is large. We derived explicit expressions for the PGF of the number of customers (conditioned on the server state) in the system. The closed forms to find the mean number of customers in the systems as well as the mean sojourn time are given also in this work.
References
Gans, N., Koole, G., Mandelbaum A.: Telephone call centres: Tutorial, review, and research prospects. Manuf. Serv. Oper. Manage. 5, 79–141 (2003)
Kulkarni, V.G., Choi, B.D.: Retrial queues with server subject to breakdowns and repairs. Queueing Syst. 7(2), 191–209 (1990)
Madan, K.C., Abu Al-Rub, A.Z.: On a single server queue with optional phase type server vacations based on exhaustive deterministic service and a single vacation policy. Appl. Math. Comput. 149, 723–734 (2004)
Maraghi, F.A., Madan, K.C., Darby-Dowman, K.: Bernoulli schedule vacation queue with batch arrivals and random system breakdowns having general repair time distribution. Int. J. Oper. Res. 7(2), 240–256 (2010)
Khalaf, R.F., Madan, K.C., Lucas, C.A.: An M[X] /G/1 queue with bernoulli schedule, general vacation times, random breakdowns, general delay times and general repair times. Appl. Math. Sci. 5(1), 35–51 (2011a)
Khalaf, R.F., Madan, K.C., Lucas, C.A.: An M[X]/G/1 queue with bernoulli schedule general vacation times, general extended vacations, random breakdowns, general delay times for repairs to start and general repair times. J. Math. Res. 3(4), (2011b) (In Press).
Khalaf, R.F., Madan, K.C., Lucas, C.A.: On a batch arrival queuing system equipped with a stand-by server during vacation periods or the repairs times of the main server. J. Probab. Stat. Article ID 812726 (2011c). doi:10.1155/2011/812726
Khalaf, R.F., Madan, K.C., Lucas, C.A.: On an M[X]/G/1 queueing system with random breakdowns, server vacations, delay times and a standby. Int. J. Oper. Res 15(1), 30–47 (2012)
Khalaf, R.F., Queueing systems with four different main server’s interruptions and a stand-by server. Int. J. Stat. Probabilit. Accepted. (2013)
Palm, C.: Methods of judging the annoyance caused by congestion. Tele 4, 189–208 (1953)
Palm, C.: Research on telephone traffic carried by full availability groups. Tele 1, 107 (1957)
Altman, E., Yechiali, U.: Analysis of customers impatience in queues with server vacations. Queueing Syst. 52, 261–279 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Khalaf, R.F. (2014). Analysis of Customers’ Impatience in M/M/1 Queues with Server Subject to Random Breakdowns and Exponential Vacations. In: Ansari, A. (eds) Advances in Applied Mathematics. Springer Proceedings in Mathematics & Statistics, vol 87. Springer, Cham. https://doi.org/10.1007/978-3-319-06923-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-06923-4_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06922-7
Online ISBN: 978-3-319-06923-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)