Abstract
In this paper, an M/M/1 queueing system with a single working vacation and impatient customers is considered. In this system, the server has a slow rate to serve during a working vacation and customers become impatient due to a slow service rate. The server waits dormant to the first arrival in case that the server comes back to an empty system from a vacation, thereafter, opens a busy period. Otherwise, the server starts a busy period directly if the queue system has customers. The customers’ impatient time follows independently exponential distribution. If the customer’s service has not been completed before the customer becomes impatient, the customer abandons the queue and doesn’t return. The model is analyzed and various performance measures are derived. Finally, several numerical examples are presented.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
81.1 Introduction
Queueing systems with customer impatience such as hospital emergency rooms handling critical patients, and inventory systems that store perishable goods, is very popular. Due to their potential application, many authors are interest in studying the queueing systems with impatient customers and treat the impatience phenomenon by various assumptions. The first to analyze queueing systems with impatient customers seems to be Palm’s pioneering work (1953) by considering the \( {M \mathord{\left/ {\vphantom {M {{M \mathord{\left/ {\vphantom {M c}} \right. \kern-0pt} c}}}} \right. \kern-0pt} {{M \mathord{\left/ {\vphantom {M c}} \right. \kern-0pt} c}}}\) queue, where the waiting times is assumed to be independent exponential distribution. Daley (1965) studied the GI/G/1 queue with impatient customers, in which customers may abandons the system before starting or completing their service when they have to wait too long. And these results are extended by several authors in many different directions. A customer abandons the queue when he has a long wait already experienced, or a long wait anticipated upon arrival, for example Takacs (1974), Baccelli et al. (1984), Boxma and de Waal (1994), Van Houdt et al. (2003), and Yue and Yue (2009). Recently, the queueing models with server vacation and impatient customers are analized by Altman and Yechiali (2006) .
This work is supported by the Fundamental Research Funds for the Central Universities, No. ZYGX2010J111, No. ZYGX2011J102, and Yunnan Provincial Natural Science Foundation of China under Grant No. 2011FZ025.
In 2002, A class of semi-vacation policies had been introduced by Servi and Finn (2002). In this system the server don’t completely stop service but works at a lower rate during a vacation. This system is called a working vacation (WV) system. The vacation time is assumed to be exponentially distributed. The service times during a regular service period and during a working vacation follow exponential distribution but with different rates. Zhao et al. (2008) ultilize the quasi birth and death process and the matrix-geometric solution method to study an M/M/1 queueing system with a single working vacation and obtain various performance measures. An M/G/1 queue with multiple working vacations has been studied by Wu and Takagi (2006). In addition, many authors extended these results such as Baba (2005), Li et al. (2009).
However, there are few literatures which take customers’ impatient during a working vacation into consideration. An M/M/1 queueing system with working vacations and impatient customers is considered by Yue and Yue (2011). We extend the research in Yue and Yue 2011 to an M/M/1 queueing system with a single working vacation and impatient customers. For practical application, the single working vacation policy has been widely used in managing science. When the system has relatively few the number of customers, it becomes important to economize operation cost and energy consumption, so the system needs to work at a lower rate operation state. The model (Yue and Yue 2011) is one case of our analysis. We analyze the queueing system where the server has a slow rate to serve during a working vacation and customers become impatient due to a slow service rate in this paper. The server waits dormant to the first arrival in case that the server comes back to an empty system from a vacation, thereafter, opens a busy period. Otherwise, the server starts a busy period directly if the queue system has customers. The customers’ impatient time follows independently exponential distribution. If the customer’s service has not been completed before the customer becomes impatient, the customer abandons the queue and doesn’t return.
We organize the rest of this paper as follows: the model description is given in Sect. 81.2. Then we derive the balance equations for the system. A differential equation for \( G_{0} \left( z \right) \) is obtained, where \( G_{0} \left( z \right) \) is the generating function of the queue size when the server is on vacation. It is easy to calculate the fractions of time the server being in working vacation or busy period. Various performance measures including the mean system size, the mean sojourn time of a customer served is obtained. Section 81.3 gives are some numerical results.
81.2 Analysis of the Model
81.2.1 Description of the Model
We study an M/M/1 queue with a single working vacation and impatient customers. We assume that arrival process follows Poisson proccess with parameter \( \lambda \), and the rule of serving is on a first-come first-served (FCFS) basis. If the server returns from a working vacation to find the system empty, he waits dormant to the first arrival thereafter and open a busy period. The working vacation follows exponential distribution with parameter \( \gamma \), and the service times during a service period and a working vacation follow exponential distribution with parameters \( \mu_{b} \) and \( \mu_{v} \), respectively, where \( \mu_{b} > \mu_{v} \). During the working vacation, customers become impatient and the impatient times follows exponential distribution with parameter \( \xi \). If the customer’s service has not been completed before the customer becomes impatient, the customer abandons the queue and doesn’t return.
Remark 1. If \( \mu_{v} = 0 \), the current model becomes the M/M/1 queueing model which has a single vacation and impatient customers, and was studied by Altman and Yechiali (2006). If \( \xi = 0 \), the current model has a single working vacation, it was studied by Zhao et al. (2008).
81.2.2 Balance Equations of the Model
The total number of customers in the system and the number of working servers are denoted by \( L \) and J, respectively. In other words, when \( J = 0 \). The server is in a working vacation, and when \( J = 1 \), the server is in a service period. Then, the pair \( \left\{ {J,L} \right\} \) constructs a continuous-time Markov process with transition-rate diagram shown in Fig. 81.1. Here, the steady-state transition probabilities are defined by \( P_{jn} = P\left\{ {J = j,L = n} \right\} \). \( j = 0,1;n = 0,1,2, \ldots \).
Then, we can get the set of balance equations as follows:
The probability generating functions (PGFs) is defined by
Then, multiplying (81.1) by \( z^{n} \), summing over \( n \), and rearranging terms, we get
where \( G_{0}^{'} \left( z \right) = \frac{{dG_{0} \left( z \right)}}{dz}. \) We also use the same way and obtain from (81.2)
Remark 2.
-
(1)
Letting \( \mu_{v} = 0 \) in (81.3), we get
This agrees with Altman and Yechiali (2006) (see (5.3), p. 274).
-
(2)
Letting \( \xi = 0 \) in (81.4), we get the \( {M \mathord{\left/ {\vphantom {M {{M \mathord{\left/ {\vphantom {M 1}} \right. \kern-0pt} 1}}}} \right. \kern-0pt} {{M \mathord{\left/ {\vphantom {M 1}} \right. \kern-0pt} 1}}} \) with a single working vacation. This agrees with Zhao et al. (2008).
81.2.3 Solution of the Differential Equation
For \( z \ne 0 \) and \( z \ne 1 \), (81.3) can be written as follows:
Multiplying both sides of (81.6) by
we get
Integrating from 0 to z we have
where
Equation (81.8) expresses \( G_{0} \left( z \right) \) in terms of \( P_{00} \) and \( P_{11} \). Also, from (81.4), \( G_{1} \left( z \right) \) is a function of \( G_{0} (z) \), \( P_{00} \), \( P_{11} \). Thus, once \( P_{00} \) and \( P_{11} \) are calculated, \( G_{0} \left( z \right) \) and \( G_{1} \left( z \right) \) are completely determined. We derive the probabilities \( P_{00} \), \( P_{11} \) and the mean system sizes in the next subsection.
81.2.4 Derivation of Various Performance Measures
Let \( P_{j.} = G_{j} \left( 1 \right) = \sum\nolimits_{n = 0}^{\infty } P_{jn} \) and \( E\left[ {L_{j} } \right] \). \( = G_{j}^{'} \left( 1 \right) = \sum\nolimits_{n = 0}^{\infty } nP_{jn} \) \( j = 0,1, \ldots \). Then from (81.3) we get
From (81.8), we have
, since \( G_{0} \left( 1 \right) = P_{0.} = \sum\nolimits_{n = 0}^{\infty } P_{0n} > 0 \),
and \( \mathop {\lim }\nolimits_{z \to 1} \left( {1 - z} \right)^{{ - \frac{\gamma }{\xi }}} \,=\, \infty \), we must have
implying that
And (81.4) can be written as
By using L’Hopital rule, we derive
implying that
On the other hand, from (81.3),
implying that
Equating the two expressions (81.14) and (81.16) for \( E\left[ {L_{0} } \right] \), and using \( 1 = P_{0} + P_{1} \), we get
where
From (81.12) we have
where
From (81.3) we get
Thus, the mean system size
From (81.14), the necessary and sufficient condition for stability \( \lambda < \mu_{b} \), for otherwise \( E\left[ {L_{0} } \right] = - P_{00} < 0 \).
81.2.5 Sojourn Times
Denote \( S \) the total sojourn time of a customer in the system, which is measured from the moment of arrival to departure, including completion of service and a result of abandonment. By using Little’s law,
Denote \( S_{served} \) the total sojourn time of a customer who completes his service. We note that\( S_{served} \)is more important porfermance measure. Denote \( S_{jn} \) the conditional sojourn time of a customer who does not leave the system, and \( \left( {j,n} \right) \) is the state on his arrival. Evidently, \( E\left[ {S_{1n} } \right] = {{\left( {n + 1} \right)} \mathord{\left/ {\vphantom {{\left( {n + 1} \right)} \mu }} \right. \kern-0pt} \mu } \), but this is for \( n = 0,1,2, \ldots \) rather than for \( n \ge 1 \) in (81.15).
Now, we derive \( E\left[ {S_{0n} } \right] \) by using the method used by Altman and Yechiali (2006), when \( J = 0 \), for \( n \ge 1 \),
where
for \( n = 0,1,2, \)…. The second term above is derived from the fact that a new arriving customer does not influence the sojourn time of a customer present in the system. The probability \( {n \mathord{\left/ {\vphantom {n {\left( {n + 1} \right)}}} \right. \kern-0pt} {\left( {n + 1} \right)}} \)in the third term comes from the fact that when one of the \( n + 1 \) waiting customers abandons, our customer is not the one to leave.
Then,
We also have
implying that
Iterating (81.23) we obtain, for \( n \ge 1 \),
Finally, we use the expression for \( E\left[ {S_{1n} } \right] \) and drive
implying that
But the first sum in (81.28) starts from \( n = 0 \), it’s different from [15].
81.3 Numerical Results
In this section, we show the numerical examples for the results obtained in Sect. 81.2.4. The effectes of \( \mu_{v} \) and \( \xi \) on \( E\left[ {L_{0} } \right] \) and \( E\left[ L \right] \) in (81.14) and (81.21) are shown in Fig. 81.2. Evidently, with \( \mu_{v} \) increaseing, namely, the server works faster and faster, the mean system size of working vacation \( E\left[ {L_{0} } \right] \) and the mean system size \( E\left[ L \right] \) decreases when \( \xi \) is fixed. We also find that if \( \xi \) is smaller, \( E\left[ {L_{0} } \right] \) and \( E\left[ L \right] \) are bigger. From the numerical analysis, the influence of parameters on the performance measures in the system is well demonstrated. The results are suitable to practical situations.
81.4 Conclusions
In this paper, we have studied M/M/1 queueing systems with a single working vacation and impatient customers. In this system, the server has a slow rate to serve during a working vacation and customers become impatient due to a slow service rate. The server waits dormant to the first arrival in case that the server comes back to an empty system from a vacation, thereafter, opens a busy period. Otherwise, the server starts a busy period directly if the queue system has customers. The customers’ impatient time follows independently exponential distribution. If the customer’s service has not been completed before the customer becomes impatient, the customer abandons the queue and doesn’t return. The probability generating functions of the number of customers in the system is derived and the corresponding mean system sizes are obtained when the server was both in a service period and in a working vacation. Also, we have obtained closed-form expressions for other performance measures, such as the mean sojourn time when a customer is served.
References
Altman E, Yechiali U (2006) Analysis of customers impatience in queues with server vacations. Queueing Theory 52:261–279
Baba Y (2005) Analysis of a GI/M/1 queue with mul-tiple working vacations. Oper Res Lett 33:201–209
Baccelli F, Boyer P, Hebuterne G (1984) Single-server queues with impatient customers. Adv Appl Probability 16:887–905
Boxma OJ, de Waal PR (1994) Multiserver queues with impatient customers. ITC 14:743–756
Dalay DJ (1965) General customer impatience in the quence GI/G/1. J Appl Probab 2:186–205
Li J, Tian N, Zhang Z (2009) Analysis of the M/G/1 queue with exponentially working vacations a matrix analytic approach. Queueing Syst 61:139–166
Palm C (1953) Methods of judging the annoyance caused by congestion. Tele 4:189–208
Servi LD, Finn SG (2002) M/M/1 queues with working vacations (M/M/1/WV). Perform Eval 50:41–52
Takacs L (1974) A single-server queue with limited virtual waiting time. J Appl Probab 11:612–617
Van Houdt B, Lenin RB, Blonia C (2003) Delay distribution of (im)patient customers in a discrete time D-MAP/PH/1 queue with age-dependent service times. Queueing Syst 45:59–73
Wu D, Takagi H (2006) M/G/1 queue with multiple working vacations. Perform Eval 63:654–681
Yue D, Yue W (2009) Analysis of M/M/c/N queueing system with balking, reneging and synchronous vacations. Advanced in queueing theory and network applicantions. Springer, New York, pp 165–180
Yue D, Yue W (2011) Analysis of a queueing system with impatient customers and working vacations. QTNA'11 Proceedings of the 6th international conference on queueing theory and network applications. ACM, NY, USA, pp 208–212
Zhao X, Tian N, Wang K (2008) The M/M/1 Queue with Single Working Vacation. Int J Inf Manage Sci 19:621–634
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, Xm., Wu, Da., Wu, L., Lu, Yb., Peng, Jy. (2013). An M/M/1 Queue System with Single Working Vacation and Impatient Customers. In: Qi, E., Shen, J., Dou, R. (eds) The 19th International Conference on Industrial Engineering and Engineering Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38391-5_81
Download citation
DOI: https://doi.org/10.1007/978-3-642-38391-5_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38390-8
Online ISBN: 978-3-642-38391-5
eBook Packages: Business and EconomicsBusiness and Management (R0)