JID: JOEMS

ARTICLE IN PRESS [m5G;November 25, 2016;5:53]

Journal of the Egyptian Mathematical Society 0 0 0 (2016) 16

Contents lists available at ScienceDirect

Journal of the Egyptian Mathematical Society

journal homepage: www.elsevier.com/locate/joems

Transient solution of an M/M/1 vacation queue with a waiting server

and impatient customers
Sherif I. Ammar a,b
a
Mathematics Department, Faculty of Science, Menoa University, Shebin El Kom, Egypt
b
Department of Mathematics, College of Science, Taibah University, Madinah Munawwarah, Saudi Arabia

a r t i c l e i n f o a b s t r a c t

Article history: Recently, Ammar [1] has discussed the transient behavior of a multiple vacations queue with impatient
Received 13 March 2016 customers. In this paper, a similar technique is used to derive a new elegant explicit solution for an
Revised 20 July 2016
M/M/1 vacation queue with impatient customers and a waiting server, where the server is allowed to take
Accepted 30 September 2016
a vacation whenever the system is empty after waiting for a random period of time. If the server does
Available online xxx
not return from the vacation before the expiry of the customer impatience time, the customer abandons
the system forever. Moreover, the formulas of mean and variance expressed in terms of the obtained
MSC
60K25
possibilities for this model.
68M20 2016 Egyptian Mathematical Society. Production and hosting by Elsevier B.V.
90B22 This is an open access article under the CC BY-NC-ND license.
(http://creativecommons.org/licenses/by-nc-nd/4.0/)
Keywords:
Transient probabilities
M/M/1 queue
server vacations
A waiting server
Generating functions

1. Introduction and M/M/cqueue with server vacations and customer impatience,

In recent years, the study of vacation queues has had a great
effect on the queueing theory. This has been because of their
wide applications in many areas, especially in the computer com-
munication and exible manufacturing systems. Since Levy and
Yechiali [2] have presented a paper about server vacations, many
researchers have studied queueing systems with vacations. For the
background of such vacations systems (see the excellent overviews
of in [3,4] and the monographs in [5,6].
The investigation of queueing models with impatient customers
is very helpful and imperative as such systems often arise in
many real life problems, see e.g., [7,8]. Therefore, many researchers
have studied queueing systems with impatient customers. For re-
lated literature, interested readers may refer to [9] and references
therein. The studies of queueing systems with impatient customers
classied according to the causes of the impatience behavior. Thus,
in literatures we accentuation the models that are created by im-
patient customers due to server vacations.
Recently, Altman and Yechiali [10] have showed a compre-
hensive analysis of some queueing models such as M/M/1, M/G/1
E-mail address: sherifamar20 0 0@yahoo.com
where customers became impatient only when the servers were on
vacation. They discussed both single and multiple vacation cases,
and obtained various closed-form results. Altman and Yechiali
[11] have investigated the innite server queue with vacations and
impatient customers. They have acquired the probability generat-
ing function of the number of units in the model and computed
values of key performance measures. Perel and Yechiali [12] have
studied M/M/cqueues in a 2-phase (fast and slow) Markovian ran-
dom environment, with impatient customers. Yue et al. [13] have
analyzed an M/M/1 queueing system with working vacation and
impatient customers. They obtained the probability generating
function of the number of units in the model when the server is
in a working vacation and a service period. Yue et al. [14] extend
the model in [10] by considering a variant of the multiple vacation
policy which includes both a single vacation and multiple vaca-
tions, they have derived the probability generating functions of the
steady state probabilities and obtained the closed form expressions
of the system sizes when the server is in different states. Adan
et al. [15] have addressed queueing systems with vacations and
synchronized reneging.
Padmavathy et al. [16] have studied the steady state behav-
ior of vacation queues with impatient customers and a waiting
Server.

http://dx.doi.org/10.1016/j.joems.2016.09.002
1110-256X/ 2016 Egyptian Mathematical Society. Production and hosting by Elsevier B.V. This is an open access article under the CC BY-NC-ND license.
(http://creativecommons.org/licenses/by-nc-nd/4.0/)

Please cite this article as: S.I. Ammar, Transient solution of an M/M/1 vacation queue with a waiting server and impatient customers,
Journal of the Egyptian Mathematical Society (2016), http://dx.doi.org/10.1016/j.joems.2016.09.002
JID: JOEMS
ARTICLE IN PRESS [m5G;November 25, 2016;5:53]

2 S.I. Ammar / Journal of the Egyptian Mathematical Society 000 (2016) 16

In spite of the great interest in studying of queuing systems  (t ) = ( + )P (t ) + P (t ) + P (t )

P00 (3.1)
00 01 10
with vacations, a few works have dealt with the transient solution
of these systems. Kalidass et al. [17] have discussed the transient
behavior of an M/M/1 multiple vacation queue and the possibilities P0 n (t ) = P0,n1 (t ) ( + n + )P0n (t ) + (n + 1 ) P0,n+1 (t ),
of catastrophes. Sudhesh and Francis Raj [18] have obtained the
time dependent system size probabilities of a M/M/1 queue with n = 1, 2, 3, . . . (3.2)
working vacation. Indra and Sweety [19] have derived the transient
 (t ) = ( + )P (t ) + P (t ) + P (t )
P10 (3.3)
solution of an unreliable M/G/1 vacations queue. 10 11 00
Recently, Ammar [1] has investigated the transient solution of a
M/M/1 multiple vacations queue and impatient customers.
As we mentioned earlier in all the previous studies, the server P1 n (t ) = P1,n1 (t ) ( + )P1n (t ) + P1,n+1 (t ) + P0n (t ),
leaves the system just as the system is empty of customers, but in n = 1, 2, 3, . . . (3.4)
the practical life the server waits a certain period of time even if
the system is empty, especially, if we are dealing with human be- and suppose that initially there is no unit in the system.
havior. This conduct of the server was initially presented in [20].
Based on [20] Yechiali [21] has extended the analysis to batch ar- 3.1. Time dependent probabilities
rival queue.
Therefore, the main aim of this article is to study the M/M/1 3.1.1. Evaluation for P0n (t)
vacation queue with impatient customers and a waiting server. We We obtain expression for P0n (t)by employing the continued
have obtained in closed form the transient probabilities, mean and fraction and well-known identities of conuent hypergeometric
variance. This work may be regarded as an extension to work in function. In the sequel, g(s )denotes the Laplace transform of g(t)..
[22] where the transient probabilities of the system are derived Now, by taking the Laplace transforms on (3.2), we get.
without impatient customers.
P0n (s )
=
2. System model P0,n1 (s )
P
s + + + n (n + 1 ) 0,n+1
(s )
P0n (s )

We consider a M/M/1 vacation queue with customers impa- The above equation can be written as a continued fraction as
tience and a waiting server. The assumption of the model are as follows,
follows:
P0n (s )
a) Customers arriving according to a Poisson process with rate = (n+1 )
P0,n1 (s ) s + + + n (n+2 )
and the server has an independently and identically distributed s++ +(n+1 ) (n+3 )
s++ +(n+2 )
s++ +(n+3 ) ...
exponential service time distribution with mean service disci-
pline is FCFS and there is innite room for customers to wait. (3.5)
b) When the busy period is ended the server waits a random du-
By means of the properties of conuent hypergeometric function.
ration of time before beginning on a vacation. This waiting du-
The Eq. (3.5) will take the following form
ration follows the exponentially distributed with the density
s+
function as follows: P0n (s ) 1 F1 (n + 1; + n + 1; )
= (3.6)
w(t ) = et t 0, 0 P0,n1 (s ) ( s+ + n )F1 (n; s+ + n;
)
where is the waiting rate of a server. Invoking of the above equation we can obtain for n = 1, 2, 3,
c) It is assumed that the interval of vacation has an exponential ...
distribution with the density function as follows:  n s+
1 1 F1 (n + 1; + n + 1; )
v(t ) = e t
t 0, 0 P0n (s ) = n s+ P00 (s )
+ +
j=1 ( + j ) ( + n )1 F1 (1; + 1; )
s s

where is the vacation rate of a server.

d) When the server is on a vacation, each customer sets up an
=
n (s )P00 (s )
impatience timer independently of the other customers in the Then
system, which is assumed to be exponentially distributed with
the density function as follows: P0n (s ) = n (t ) P00 (t ) (3.7)

s(t ) = e t t 0, 0 where n (t) is the inverse transform of 

n (s ) and the formula of
it given in Section 3.7, and where denotes convolution.
where is the impatience rate of a server.
e) If the impatience timer expires while the server is on a vaca-
tion, the customer abandons the queue, never to return. 3.1.2. Evaluation for P1n (t)
We will evaluate the probability P1n (t), n 1.
Dene
3. Transient behavior


Let N(t)be the number of units in the system at time t, and X(t) Pi (z, t ) = Pin (t )zn i = 0, 1. (3.8)
n=1
denote the system state at timet. If X(t) = 1, the server is work-
ing and serving units, whilst if X(t) = 0, the server is on vacation. The system of Eqs. (3.3) and (3.4) yield

P1 (z, t )      
Then {X(t), N(t), t 0}is a continuous time Markov chain. Let
1 1
Pij (t) = P[X(t) = i, N(t) = j] denote the system state in the transient = (z 1 ) 1 P1 (z, t ) + 1
probabilities. These probabilities satisfy the forward Kolmogorov t z z
differential-difference equations are given by: P10 (t ) + P0 (z, t )

Please cite this article as: S.I. Ammar, Transient solution of an M/M/1 vacation queue with a waiting server and impatient customers,
Journal of the Egyptian Mathematical Society (2016), http://dx.doi.org/10.1016/j.joems.2016.09.002
JID: JOEMS
ARTICLE IN PRESS [m5G;November 25, 2016;5:53]

S.I. Ammar / Journal of the Egyptian Mathematical Society 000 (2016) 16 3

Integrating For n = 0,

 0 = e(+)t n I0 (t ) + ( ) n
P1 (z, t ) = e[(z+ z )(+)]t + ( ) )
t
z

t P10 (v )I0 ( (t v ))e(+)(tv ) dv
((z+ z )(+ ))(tv )
P10 (v )e dv 0

0 t

t n+1 P10 (v )I1 ( (t v ))e(+)(tv ) dv

+ P0 (z, v )e((z+ z )(+))(tv ) dv (3.9)
t
0

0
  + P0k (v ) k Ik ( (t v ))e(+)(tv ) dvdv (3.13)
It is well known that if = 2 and = /, then 0
k=0

 

The Laplace transform of Eq. (3.13) given as follows
exp z + t = ( z )n In (t ),   r

z n=  p p2 2
 P0r (s )
p2 2 2
where In (.) is the modied Bessel function. r=0

Comparing the coecients of zn on right and left hand sides in 1

 
(3.9), we get for n = 1, 2, 3, =  1 + ( )P10 (s ) p2 2 P10 (s )
p2 2
 
P1n (t ) = e(+)t n In (t ) + ( ) n 1

t ( p p2 2 )P10 (s ) (3.14)
2
P10 (v )In ( (t v ))e(+)(tv ) dv
0 Substituting (3.14) in (3.11), and considerably simplifying the

t working, we obtain
(+ )(tv )
n+1
P10 (v )In+1 ( (t v ))e dv  n
0


t
n p p2 2
P1n (s ) = 
+ P0k (v ) nk Ink ( (t v ))e(+)(tv ) dvdv p2 2 2
0
k=0   n
(3.10) ( ) n p p2 2
+ P10 (s )
p2 2 2
Taking the Laplace transform of the above equations and sim-
plifying, we have   n+1
n+1 p p2 2
  n  P10 (s )
1 p p2 2 p2 2 2
P1n (s ) =   nk
p2 2 2 n1

nk  p p2 2
  n + P0k (s )
( ) p p2 2 p2 2 k=0 2
+ P10 (s )
p2 2 2 n (s )  
+ 1 + ( )P10 (s ) p2 2 P10 (s )
  n+1 p2 2
p p2 2    
 P10 (s ) 1
p2 2 2 p p2 2 P10 (s )
2
  nk
n1 which on inversion yields an explicit expression for us the follow-
 p p2 2
+  P0k (s ) ing equation P1n (t) given by
p2 2 2
k=0
  r P1n (t ) = n (In1 (t ) In+1 (t ) )e(+)t

n (s )  p p2 2 + ( ) n P10 (t ) In (t )e(+)t
+ P0r (s ) (3.11)
p2 2 r=0 2 n+1 P10 (t ) In+1 (t )e(+)t
+ n (t ) I0 (t )e(+)t
where p = s + +
As Pi (z, t) does not contain terms with negative powers of z ( )P10 (t ) n (t ) I0 (t )e(+)t + n (t ) P10 (t )

the right-hand side of (3.10) with nreplaced by n must be zero. + n (t ) P10 (t ) I1 (t )e(+)t
Thus, 2
n1

0 = e(+)t n In (t ) + ( ) n + nk P0k (t )Ink (t ) e(+)t (3.15)

t k=0
P10 (v )In ( (t v ))e(+)(tv ) dv
0 Thus we have expressed P1n (t) in terms of P0n (t) and P10 (t).

t
n+1 P10 (v )In+1 ( (t v ))e(+)(tv ) dv 3.1.3. Evaluation for P10 (t)
0

t
Comparing the coecients of z 1 on both sides of Eq.
+ P0k (v ) (n+k ) In+k ( (t v ))e(+)(tv ) dvdv (3.12) and using I n (x) = In (x), we get
0
0 = e(+)t 1 I1 (t ) + ( ) 1
k=0
(3.12)
t
P10 (v )I1 ( (t v ))e(+)(tv ) dv
using I n (x) = In (x). 0

Please cite this article as: S.I. Ammar, Transient solution of an M/M/1 vacation queue with a waiting server and impatient customers,
Journal of the Egyptian Mathematical Society (2016), http://dx.doi.org/10.1016/j.joems.2016.09.002
JID: JOEMS
ARTICLE IN PRESS [m5G;November 25, 2016;5:53]

4 S.I. Ammar / Journal of the Egyptian Mathematical Society 000 (2016) 16

t 3.2. Performance measures
P10 (v )I0 ( (t v ))e(+)(tv ) dv
0

t
3.2.1. Mean
+ P0k (v ) (k+1) Ik+1 ( (t v ))e(+)(tv ) dvdv Let E(V(t)) be the average number of customers in the model at
0 time t, then E(V(t)) is given by the expression
k=0
(3.16 )

E (V (t )) = m(t ) = n(P0n (t ) + P1n (t ))
Taking Laplace transform of (3.16) and simplifying, we get
n=1

1

  r   r+1

P10 (s ) = (1 )r+1 p p2 2 m (t ) = n(P  0n (t ) + P  1n (t ))
2 2
r=0 n=1

  r   r+1
From Eqs. (3.2)(3.4) and after considerable mathematical ma-
+ (1 ) r+1
p p2 2
2 2 nipulations, the above equation will lead to the following differen-
r=0
  k tial equation

 p p2 2


P0k (s ) (3.17) m (t ) = + P10 (t ) + P0n (t ) nP0n (t )
k=0

n=1 n=1
Inverting (3.17) we obtain the expression of P10 (t) as follows Therefore,

 r

1  ( ) t
P10 (t ) = (1 )r+1 [Ir (t ) Ir+2 (t )]e(+)t m(t ) = ( )t + P10 (y ) dy
2 2 0


t
r=0

 r  t

 r+1 ( ) + P0n (y )dy n P0n (y )dy (3.21)
+ (1 )
2 n=1 0 n=1 0
2
r=0
  where P0n (t) and P10 (t) are given in (3.7) and (3.18).
(Ir (t ) Ir+2 (t ) )e(+)t

 3.2.2. Variance
k P0k (t ) [Ik1 (t ) Ik+1 (t )]e(+)t (3.18) Let Var(V(t)) be the variance number of customers in the model
k=0 at time t, then Var(V(t)) is given by the expression
3.1.4. Evaluation for P00 (t) V ar (V (t )) = E[V 2 (t )] [E (V (t ))]2
On applying Laplace transform to the system Eq. (3.1), we have V ar (V (t )) = u(t ) [m(t )]2

(s + + )P00 (s ) = P01 (s ) + P10 (s ) (3.19) where


Now, using (3.7) and (3.17) in (3.19) and after some mathemat- u(t ) = E[V 2 (t )] = n2 (P  0n (t ) + P  1n (t ))
ical manipulation, we obtain n=1
 
  m
m m m j From Eqs. (3.2)(3.4) and after considerable mathematical ma-
P00 (s ) = (1 ) j
2 2 nipulations, the above equation will lead to the following differen-
m=0 j=0
tial equation
 m+1
1

j 
r (s )
u (t ) = ( + ) + 2( )m(t ) 2 n2 P0n (t )
s++ 1

  n=1

  r   r+1 m j+1



r+1 + nP0n (t ) + 2 nP0n (t ) P0n (t ) P10 (t )
(1 ) p p2 2
2 n=1 n=1 n=1
r=0
  k m j Therefore,

 p p 2 2
t
 k (s )
V ar (v(t )) = ( + )t + 2( ) m(y )dy
r=0
0


t

t
which on inversion yields an explicit expression for P00 (t) as 2 n2 P0n (y )dy + n P0n (y )dy
 
m j j (+ )t t m
n=1 0 n=1 0

 m
m

P00 (t ) = (1 )m j e r1 (t )  t
 t
2 2 m! + 2 n P0n (y )dy P0n (y )dy
m=0 j=0
  r  (m j+1) n=1 0 n=1 0

r+1 ( )
t
(+ )t
(1 ) (Ir (t ) Ir+2 (t ) )e P0n (y )dy [m(t )]2 (3.22)
2 0
r=0
  ( m j ) 3.3. Expression for n (t)


jm [Ik1 (t ) Ik+1 (t )]e(+ )t k (t ) (3.20)
r=0

where (m j + 1) denotes (m j + 1)-fold convolution and (m j)

 n s+
1 1 F1 (n + 1; + n + 1; )
denotes (m j)-fold convolution. n (s ) = n s+
s+ s+
j=1 ( + j ) ( + n )1 F1 (1; + 1; )
Thus, Eqs. (3.7), (3.15), (3.18) and (3.20) taken together complete
the transient solution. (3.7.1)

Please cite this article as: S.I. Ammar, Transient solution of an M/M/1 vacation queue with a waiting server and impatient customers,
Journal of the Egyptian Mathematical Society (2016), http://dx.doi.org/10.1016/j.joems.2016.09.002
JID: JOEMS
ARTICLE IN PRESS [m5G;November 25, 2016;5:53]

S.I. Ammar / Journal of the Egyptian Mathematical Society 000 (2016) 16 5

The Eq. (3.7.1) takes the form waiting server. We have derived closed form explicit expressions
  analytically for the system size probabilities, mean and variance by
n+m
s+ ( )m employing Laplace transforms, continued fractions and generating
1 F1 ( n + 1; + n + 1; )
 m functions. These expressions can be easily evaluate numerically if
n s+ = n n+m (3.7.2)
j=1 ( + j ) j=1 (s + + j )
desired.
m=0

By resolving into partial fractions, we have A. Appendix: conuent hypergeometric function

s+   
1 F1 (n + 1; + n + 1; ) 
n+m
n s+ = n We display the denition of conuent hypergeometric function
j=1 ( + j ) m=0
m and some properties of this function. The conuent hypergeomet-
+m
n ric function is denoted by 1 F1 (a; c; z) and is dened by the power
(1 ) j1
(3.7.3) series
( j 1 )! ( n + m j )! ( s + + j )
j=1
a z a (a + 1 ) z2
1 F1 (a; c; z ) = 1 + + +
Also, c 1! c (c + 1 ) 2!
 

s+

 ( )m (a )k zk
1 F1 1; + 1; = m = (2.1)
j=1 (s + + j )
(c )k k!
m=0 k=0

 provided that c does not equal 0, 1, 2,. Here ( )k is the rising
= ( )m dm (s ), m = 1, 2, 3, . . . factorial function (the Pochhammer symbol), which is dened by:
m=0

( + k )
where, ( )n =

( )

 ( )m
dm ( s ) = m We observe that
j=1 (s + + j )
m=0
1 F1 (0; c; z ) = 1.

m
(1 )r1
= m = 1, 2, 3, . . . The quotient of two hypergeometric functions may be ex-
r=1
( r 1 )! ( m r )! ( s + + r ) pressed as continued fractions. The following identity from
Lorentzen and Waadeland [24].
Using the equality given in [23], we get
  1 1 F1 ( a + 1; c + 1; z ) c ( a + 1 )z ( a + 2 )z
s+

 = ,
1 F1 1; + 1; = gm (s )m , (3.7.4) 1 F1 (a; c; z ) c z+ c z + 1+ c z + 2+
m=0 which can be rewritten as
where g0 (s) = 1 and for m = 1, 2, 3, 1 F1 (a; c; z ) ( a + 1 )z ( a + 2 )z
  c (c z ) = . (2.2)
 d1 ( s ) 1  F
1 1 ( a + 1 ; c + 1 ; z ) c z + 1+ c z + 2+
 d (s ) d1 ( s ) 
 2 1  References
 d3 ( s ) d2 ( s ) d1 ( s ) 
 
gm ( s ) =  . .. ..  [1] S.I. Ammar, Transient analysis of an M/M/1 queue with impatient behavior and
 .. . . 
  multiple vacations, Appl. Math. Comput. 260 (2015) 97105.
dm1 (s ) dm2 (s ) dm3 (s ) d1 ( s ) 1  [2] Y. Levy, U. Yechiali, Utilization of idle time in an M/G/1 queueing system, Man-
 d (s ) dm1 (s ) dm2 (s ) d2 ( s ) d (s )
 age. Sci. 22 (1975) 202211.
m 1 [3] B. Doshi, Queueing systems with vacations - a survey, Queueing Syst. 1 (1986)

m 2966.
= (1 ) j1 d j (s )gm j (s ). [4] H. Takagi, in: Queueing Analysis: A Foundation of Performance Evaluation,
North-Holland, Amsterdam, 1991, p. 1.
j=1 [5] N. Tian, Z. Zhang, Vacation Queueing Models-Theory and Applications,
Springer-Verlag, New York, 2006.
By substituting (3.7.3) and (3.7.4) in (3.7.1), we obtain, [6] J.C. Ke, C.H. Wu, Z.G. Zhang, Recent development in vacation queueing models:

  
 n+k  a short survey, Int. J. Oper. Res. 7 (2010) 38.
n (s ) = n k dn+k ( s ) gm (s )m [7] S. Benjaafar, J. Gayon, S. Tepe, Optimal control of a production-inventory sys-

m=0
k m=1
tem with customer impatience, Oper. Res. Lett. 38 (2010) 267272.
[8] T. Bonald, J. Roberts, Performance modeling of elastic trac in overload, in:
On inversion, ACM Sigmetrics Performance Evaluation Review, 29, 2001, pp. 342343.

  
[9] C.H. Wu, J.C. Ke, Computational algorithm and parameter optimization for a
 n+k  multi-server system with unreliable servers and impatient customers, J. Com-
n (t ) = n
k
dn+k (t ) gm (t )m put. Appl. Math. 235 (2010) 547562.
m=0
k m=1 [10] E. Altman, U. Yechiali, Analysis of customers impatience in queues with server
vacation, Queueing Syst. 52 (2006) 261279.
where [11] E. Altman, U. Yechiali, Innite server queues with systems additional task and
impatient customers, Probab. Eng. Inf. Sci. 22 (2008) 477493.

m
(1 )r1 [12] N. Perel, U. Yechiali, Queues with slow servers and impatient customers, Eur. J.
dm (t ) = e( +r )t , m = 1, 2, 3, . . .
r=1
( r 1 )! ( m r )! Oper. Res. 201 (2010) 247258.
[13] D. Yue, W. Yue, G. XU, Analysis of customers impatience in an M/M/1 queue
with working vacations, J. Ind. Manag. Optim. 8 (2012) 895908.

m
gm (t ) = (1 ) j1 d j (t ) gm j (t ), m = 2, 3, 4, . . . ; [14] D. Yue, W. Yue, Z. Saffer, X. Chen, Analysis of an M/M/1 queueing system
with impatient customers and a variant of multiple vacation policy, in: The
j=1 7th International Conference on Queueing Theory and Network Applications
d1 (t ) = g1 (t ) (QTNA2012), Kyoto, Japan, August 2012, pp. 13.
[15] I. Adan, A. Economou, S. Kapodistria, Synchronized reneging in queueing sys-
tems with vacations, Queueing Syst. 62 (2009) 133.
4. Conclusion [16] R. Padmavathy, K. Kalidass, K. Ramanath, Vacation queues with impatient cus-
tomers and a waiting server, Int. J. Latest Trends Softw. Eng. 1 (2011) 1019.
[17] K. Kalidass, J. Gnanaraj, S. Gopinath, K. Ramanath, Transient analysis of an
In this paper, we discussed the transient solution of an M/M/1 M/M/1 queue with a repairable server and multiple vacations, Int. J. Math.
queue with impatient customers and server vacations under a Oper. Res. 6 (2014) 193216.

Please cite this article as: S.I. Ammar, Transient solution of an M/M/1 vacation queue with a waiting server and impatient customers,
Journal of the Egyptian Mathematical Society (2016), http://dx.doi.org/10.1016/j.joems.2016.09.002
JID: JOEMS
ARTICLE IN PRESS [m5G;November 25, 2016;5:53]

6 S.I. Ammar / Journal of the Egyptian Mathematical Society 000 (2016) 16

[18] R. Sudhesh, L. Francis Raj, Computational analysis of stationary and transient
distribution of single server queue with working vacation, in: Global Trends in
Computing and Communication Systems, 269, 2012, pp. 480489.
[19] Indra, B Sweety, The transient solution of an unreliable M/G/1 queue with va-
cations, Int. J. Inf. Manage. Sci. 21 (2010) 391406.
[20] J. Boxma, S. Schlegel, U. Yechiali, A note on an M/G/1 queue with a waiting
server timer and vactions, Am. Math. Soc. Translations 207 (2002) 2535 Series
2.
[21] U. Yechiali, On the Mx /G/1 queue with a waiting server and vacations, Sankhya
66 (2004) 117.
[22] K. Kalidass, K. Ramanath, Time dependent analysis of M/M/1 queue with
server vacations and a waiting server, in: The 6th International Conference on
Queueing Theory and Network Applications (QTNA2011), Seoul, Korea, 2011,
pp. 2326.
[23] I Gradshteyn, A.J. Ryzhik, D. Zwillinger, Table of Integrals, Series, and Products,
seventh ed., Academic Press is an imprint of Elsevier, 2007.
[24] L. Lorentzen, H. Waadeland, Continued fractions with applications, Studies in
Computational Mathematics, Elsevier, Amsterdam, 1992 3.

Please cite this article as: S.I. Ammar, Transient solution of an M/M/1 vacation queue with a waiting server and impatient customers,
Journal of the Egyptian Mathematical Society (2016), http://dx.doi.org/10.1016/j.joems.2016.09.002