Performance Analysis of an M/M/c/N Queueing System with Balking, Reneging and Synchronous Vacations of Partial Servers
|
|
- George Copeland
- 6 years ago
- Views:
Transcription
1 The Sixth International Symposium on Operations Research and Its Applications (ISORA 06) Xinjiang, China, August 8 12, 2006 Copyright 2006 ORSC & APORC pp Performance Analysis of an M/M/c/ Queueing System with Balking, Reneging and Synchronous Vacations of Partial Servers Dequan Yue 1 Wuyi Yue 2 Yanping Sun 1 1 College of Science, Yanshan University, Qinhuangdao, Hebei , China 2 Department of Information Science and Systems Engineering, Konan University, Kobe , Japan Abstract In this paper, we present an analysis for an M/M/c/ queueing system with balking, reneging and synchronous vacations of partial servers together. It is assumed that arriving customers balk with a probability and renege according to an exponential distribution. The vacation policy prescribes that any d (0<d<c) servers take a vacation together when these d servers find that no customers are waiting in the line at a service completion instant and c d servers are always available, either serving the customers or remaining idle. At a vacation completion instant, if the number of customers in the system is not more than c d, these d servers take another vacation together; otherwise, these d servers return to serving the queue. The service times and the vacation times are assumed to follow independent exponential distributions. By using the Markov process theory, we first develop the equations of the steady state probabilities and derive a matrix form solution of the steady-state probabilities. Then we give some performance measures of the system such as the expected number of waiting customers, the expected number of the customers in the system, the average rate of customer loss due to impatience, etc. Based on the performance analysis, we formulate a cost model to determine the optimal number of servers on vacation. Finally, we perform sensitivity analysis through numerical experiments. Keywords synchronous vacation; balking; reneging; queueing system; steady-state probability; partial servers; cost model 1 Introduction In real life, many queueing situations arise in which there may be a tendency for customers to be discouraged by a long queue. As a result, the customers either decide not to join the queue (i.e. balk) or depart after joining the queue without getting service due to impatience (i.e. renege). Balking and reneging are not only a common phenomena in queues arising in daily activities, but also in various machine repair models. For related literature, interested readers may refer to [1], [2], and references therein. An interesting example of the occurrence of balking and reneging in air defence systems is given in Ancker and Gafarian [3].
2 Performance Analysis of an M/M/c/ Queueing System 129 Queueing systems with balking, reneging, or both have been studied by many researchers. Haight [4] first considered an M/M/1 queue with balking. An M/M/1 queue with customers reneging was also proposed by Haight [5]. The combined effects of balking and reneging in an M/M/1/ queue have been investigated by Ancker and Gafarian [6], [7]. Abou-EI-Ata and Hariri [8] considered the multiple servers queueing system M/M/c/ with balking and reneging. Wang and Chang [9] extended this work to study an M/M/c/ queue with balking, reneging and server breakdowns. On the other hand, queueing models with vacations have been studied by many researchers during the past two decades and have been found to be applicable in analyzing numerous real world queueing situations such as flexible manufacturing systems, service systems, and telecommunication systems. Several excellent surveys on these vacation models have been done by Doshi [10], [11] and Takagi [12]. However, there are only a few works that take into consideration balking and reneging phenomena involving server vacations. The readers may refer to Zhang et al. [13] where an M/M/1/ queueing system with balking, reneging and server vacations was considered. Multiple server vacation models are more flexible and applicable in practice than single server counterparts. In many practical multiple server systems, some servers perform secondary jobs (take vacations) when they become idle, while other servers are always available for serving arriving customers. These types of models are called partial server vacation models". Recently, Zhang and Tian [14] studied M/M/c queueing system with synchronous vacations of partial servers. They obtained the stationary distribution of the queue length and proved several conditional stochastic decomposition results for the queue length and the customer waiting time. In this paper, we consider the balking and reneging phenomena in an M/M/c/ queueing system with the same partial server vacation policy as in [14]. The rest of this paper is organized as follows. In the next section, we give a description of the queueing model. In Section 3, we derive the steady-state equations by the Markov process method. By writing the transition rate matrix as a block matrix, we get the matrix form solution of the steady-state probabilities. In Section 4, we give some performance measures of the system. Based on the performance analysis, we formulate a cost model to determine the optimal number of servers on vacation. In Section 5, we perform sensitivity analysis through numerical experiments. Conclusions are given in Section 6. 2 System Model In this paper, we consider an M/M/c/ queueing system with balking, reneging and a vacation policy for servers. The system capacity is finite. The assumptions of the system model are as follows: (a) Customers arrive at the system one by one according to a Poisson process with arrival rate λ. The service time for each server is assumed to be distributed according to an exponential distribution with service rate µ.
3 130 The Sixth International Symposium on Operations Research and Its Applications (b) A customer who on arrival finds n customers in the system, either decides to enter the queue with probability b n or balk with probability 1 b n, 0 b n+1 b n < 1, R d n 1, b n = 0, n. (c) The vacation policy prescribes that any d (0 < d < c) servers take a vacation together when these d servers find that no customers are waiting in the line at a service completion instant and c d servers are always available, either serving the customers or remaining idle. At a vacation completion instant, if the number of customers in the system is not more than c d (still no customers waiting in line), these d servers take another vacation together; otherwise, these d servers return to serving the queue. Because these d servers take vacations simultaneously, these vacations are synchronous vacations. The vacation time is assumed to be exponentially distributed with mean 1/η. (d) After joining the queue, in the case where all the servers available are occupied, each customer will wait a certain length of time T for service to begin before they get impatient and leave the queue without receiving service. This time T is assumed to be distributed according to an exponential distribution with mean 1/α. Let i denote the number of severs being busy and n represent the number of customers in the system. If n is less than or equal to i, the customers will get service instantly upon arrival to the server, and the phenomenon of reneging will not occur. If n is greater than i, then there are n i customers who have to wait in the queue. Since the arrival and the departure of the impatient customers without service are independent, the average reneging rate in this state is given by (n i)α. (e) The service order is assumed on first-come first-served (FCFS) basis and the inter-arrival times, service times, and vacations are mutually independent. 3 Steady-State Probability In this section, we derive the steady-state probabilities by the Markov process method. 3.1 Steady-state equations Let L(t) be the number of customers in the system at time t and let { 0, d vacation servers are on vacation at time t J(t) = 1, d vacation servers are not on vacation at time t. Then {L(t),J(t)} is a Markov process with state space Ω = {(k,0) : 0 k c d} {(k, j) : c d + 1 k, j = 0,1}. Define the steady-state probabilities of the system as follows: P 0 (n) = limp{l(t) = n,j(t) = 0}, 0 n, t P 1 (n) = limp{l(t) = n,j(t) = 1}, c d + 1 n. t
4 Performance Analysis of an M/M/c/ Queueing System 131 By applying the Markov process theory, we can obtain the following set of steadystate probability equations: µp 0 (1) = λp 0 (0), λp 0 (n 1) + (n + 1)µP 0 (n + 1) = (λ + nµ)p 0 (n), 1 n < c d, (c d + 1)µP 1 (c d + 1) + λp 0 (c d 1) + [(c d)µ + α]p 0 (c d + 1) = [(c d)µ + λb c d ]P 0 (c d), λb 1 P 0 (n 1) + {(c d)µ + (n d c)α}p 0 (n + 1) = {η + (c d)µ + (n + d c)α + λb n }P 0 (n), c d < n <, λb 1 P 0 ( 1) = {η + (c d)µ + ( + d c)α}p 0 (), ηp 0 (c d + 1) + (c d + 2)µP 1 (c d + 2) = [(c d + 1)µ + λ]p 1 (c d + 1), ηp 0 (n) + λp 1 (n 1) + (n 1)µP 1 (n + 1) = (nµ + λ)p 1 (n), c d + 2 n c 1, ηp 0 (c) + λp 1 (c 1) + (cµ + α)p 1 (c + 1) = (cµ + λb c )P 1 (c), η p 0 (n) + λb n 1 P 1 (n 1) + [cµ + (n + 1 c)α]p 1 (n + 1) = [cµ + λb n + (n c)α]p 1 (n), c < n <, ηp 0 () + λb 1 P 1 ( 1) = [cµ + ( c)α]p 1 (), n=0 P 0 (n) + n=c d Matrix solution P 1 (n) = 1. In this subsection, we derive the steady-state probabilities by using the matrix analytical method. Let P = (P 0 (0),P 0 (1),...,P 0 (),P 1 (c d + 1),P 1 (c d + 2),...,P 1 ()) be the steady-state probability vector. Then, the steady-state probability equations above can be rewritten as the matrix form as follows: { PQ = 0 (1) Pe = 1 where e = (1,1,...1) T is a (2 c + d + 1) 1 vector, and the transition rate matrix Q of the Markov process has the following blocked matrix structure: Q = A 11 A 12 0 A 21 A 22 A 23. A 31 0 A 33
5 132 The Sixth International Symposium on Operations Research and Its Applications Each matrix A i j (i, j = 1,2,3) is given as follows: s 0 λ t 1 s 1 λ t 2 s A 11 =, t c d 1 s c d 1 λ t c d s c d t c d+1 A 12 = , A =... λb c d A 22 = s c d+1 λb c d t c d+2 s c d+2 λb c d t c d+3 s c d t 1 s 1 λb t s,, 0 0 v A 23 = η I, A 31 = , A 33 = u 1 λ v 2 u 2 λ v 3 u u d 1 λ v d u d λb c v d+1 u d u +d c 1 λb v +d c u +d c where A 11 is a (c d +1) (c d +1) square matrix, A 12 is a (c d +1) ( c+d) matrix, A 21 is an ( c + d) (c d + 1) matrix, A 22, A 23 and A 33 are ( c +
6 Performance Analysis of an M/M/c/ Queueing System 133 d) ( c + d) square matrixes, A 31 is an ( c + d) (c d + 1) matrix, I is an ( c + d) ( c + d) identity matrix, and (λ + iµ), 0 i c d 1 [λb s i = c d + (c d)µ], i = c d [η + λb i + (c d)µ + (i + d c)α], c d + 1 i 1 [η + (c d)µ + ( + d c)α], i =, t i = u i = v i = { iµ, 1 i c d (c d)µ + (i c + d)α, c d + 1 i, [λ + (c d + i)µ], 1 i d 1 [λb i+c d + cµ + (i d)α], d i + d c 1 [cµ + ( c)α], i = + d c, { (c d + iµ), 1 i c cµ + (i d)α, d + 1 i + d c. In the following, we derive the steady-state probabilities from Eq. (1). To accommodate the partitioned blocked structure of Q, we partition the steady-state probability vector into the segments accordingly as where P = (P 00, P 01, P 1 ) P 00 = (P 0 (0),P 0 (1),...,P 0 (c d)), P 01 = (P 0 (c d + 1),P 0 (c d + 2),...,P 0 ()), P 1 = (P 1 (c d + 1),P 1 (c d + 2),...,P 1 ()). Based on these partitions of the vector P, Eq. (1) can be rewritten as follows: P 00 A 11 + P 01 A 21 + P 1 A 31 = 0, (2) P 00 A 12 + P 01 A 22 = 0, (3) η P 01 + P 1 A 33 = 0, (4) P 00 e 0 + P 01 e 1 + P 1 e 1 = 1 (5) where the vector e 0 = (1,1,...,1) T is a (c d + 1) 1 vector, and the vector e 1 = (1,1,...,1) is an ( + d c) 1 vector. In order to solve the equations above by using the blocked matrix method, we prove that the matrixes A 11, A 22, and A 33 are invertible. We have the following lemmas. Lemma 1. The matrixes A 11 and A 33 are invertible.
7 134 The Sixth International Symposium on Operations Research and Its Applications Proof. By applying the properties of the determinant of transformation, it is easy to show that the determinant of matrix and the determinant of matrix A 11 = ( λ) c d+1 b c d 0 A 33 = ( 1) +d c c i=c d+1 Hence, the matrixes A 11 and A 33 are invertible. c iµ j=1 (cµ + jα) 0. Lemma 2. Let A = (a i j ) be an n n square matrix. If a ii > j i a i j for i = 1,2,...,n, then A = 0. Proof. Suppose that A = 0, then the matrix equation Ax = 0 has a non-trivial solution, that is, a non-zero column vector k = (k 1,k 2,...,k n ) T that satisfies Ak = 0. Let k i = max{ k 1, k 2,..., k n }, then k i = 0 since k is non-zero vector. From Ak = 0, we have or equivalently Hence, n j=1 k j a ii = a i j j i a i j k j = 0 k j a ii = a i j. j i k i k i j i a i j k j k i a i j. j i This contradicts the condition that a ii > j i a i j for i = 1,2,...,n. This contradiction shows that A = 0. Hence, we complete the proof. Lemma 3. The matrix A 22 is invertible.
8 Performance Analysis of an M/M/c/ Queueing System 135 Proof. Let a i j be the (i, j) elements of matrix A 22. Then, it is easy to see that a 11 = η + λb c d+1 + (c d)µ + α > λb c d+1 = a 1 j, j 1 a ii = η + λb c d+i + (c d)µ + iα > λb c d+i + (c d)µ + iα = a i j, 2 i + d c 1, j i a +d c = η + (c d)µ + i( + d c)α > (c d)µ + ( + d c)α = a +d c j. j +d c By Lemma 2, A 22 = 0. Hence, we prove Lemma 3. We are now ready to derive the steady-state probabilities from Eqs. (2)-(5). Let ε = (1,0,...,0) be a 1 (c d + 1) unit vector and x = ε A Then, x is a first row vector of the matrix A Hence, x is a 1 ( c + d) vector. Let y = xa Then, y is a 1 ( c + d) vector. Let δ = (0,...,0,1) be a 1 (c d + 1) unit vector and z = δ A Then, z is a last row vector of the matrix A Hence, z is a 1 (c d + 1)vector. We have the following theorem. Theorem 4. The segments of steady-state probability vector are given by P 00 = K(ηv 1 y t c d+1 x)ε T z, (6) P 01 = Kx, (7) P 1 = ηky (8) where ε T is the transpose of the unit vector ε, and the constant K = [ (y x)e 1 (ηv 1 y t c d+1 x)ε T ze 0 ] 1. (9) Proof. From Eq. (3), based on Lemma 3, we have P 01 = P 00 A 12 A 1 22 = (λb c d P 0 (c d),0,...,0) A 1 22 = λb c d P 0 (c d)ε A (10) Let K = λb c d P 0 (c d), then Eq. (10) can be rewritten as P 01 = Kx. (11)
9 136 The Sixth International Symposium on Operations Research and Its Applications Based on Lemma 1, substituting Eq. (11) into Eq. (4) yields Then substituting Eqs. (11) and (12) into Eq. (2), we get P 1 = ηky. (12) P 00 = K(η ya 31 xa 21 )A (13) By rewriting the matrix A 21 and the matrix A 31 as the partitioned blocked matrixes, we have δ z A 21 A = t c d+1 A 1 11 = t c d+1 = t c d+1ε T z (14) and A 31 A 1 11 = v 1 δ 0. 0 = v 1 z 0. 0 = v 1ε T z. (15) Substituting Eqs. (14) and (15) into Eq. (13), we get P 00 = K(ηv 1 y t c d+1 x)ε T z. (16) The constant K can be obtained as the expression given in Eq. (9) by substituting Eqs. (11), (12) and (16) into Eq. (5). Hence, the proof is completed. Remark 1. Based on Theorem 4, to compute the steady-state probability vector, we need mainly to compute the vectors x, y and z. Since it is not easy to get the expressions of the matrix A 1 11, the matrix A 1 22 and the matrix A 1 33, the vectors x, y and z are not explicitly given. However, these vectors x, y and z can be obtained by solving the linear equation xa 22 = ε, ya 33 = x and za 11 = δ, respectively. Remark 2. ote first that the results for M/M/1/ queueing system with balking, reneging and multiple server vacations are obtained by setting c = 1 and d = 1 in Eqs. (6)-(9). Eqs. (6)-(9) then correspond to the existing results in [13]. ext, note that the results for M/M/c/ queueing systems with synchronous vacations of partial servers are obtained by setting b n = 1 and α = 0 in Eqs. (6)-(9). 4 Performance Measures and Cost Model In this section, we give some performance measures of the system. Based on these performance measures, we develop a cost model to determine the optimal number of servers being on vacation.
10 Performance Analysis of an M/M/c/ Queueing System Performance measures Let ε i be a (c d + 1) 1 unit vector with the (i + 1)th element equal to 1 and the other elements equal to 0, i = 0,1,...,c d. Let δ i be a ( c+d) 1 unit vector with the ith element equal to 1 and the other elements equal to 0, i = 1,2,..., c+d. It is easy to see that { P00 ε P 0 (n) = n, 0 n c d, (17) P 01 δ n c+d, c d + 1 n and P 1 (n) = P 1 δ n c+d, c d + 1 n (18) where P 00, P 01 and P 1 are given in Theorem 4. Based on the expressions of the steady-state probabilities given by Eqs. (17) and (18), we can obtain some steady-state performance measures of the system. For notational convenience, we define the following vectors: ξ 3 = n=c+1 ξ 5 = c d ξ 1 = nε n, ξ 2 = n=1 (n c)δ n c+d, ξ 4 = n=c d+1 n=c d+1 c n=c d+1 (1 b n )δ n c+d, ξ 6 = nδ n c+d, nδ n c+d + n=c n=c+1 (1 b n )δ n c+d cδ n c+d, where ξ 1 is a (c d +1) 1 vector, ξ 2, ξ 3, ξ 4, ξ 5 and ξ 6 are ( c+d) 1 vectors. Theorem 5. The expected number of customers in the system is given by E() = P 00 ξ 1 + (P 01 + P 1 )ξ 2. (19) The expected number of the waiting customers in the queue is given by E( q ) = P 01 [ξ 2 (c d)e 1 ] + P 1 ξ 3. (20) The expected number of servers on vacation is given by E(V ) = d[p 00 e 0 + P 01 e 1 ]. (21) The expected number of busy servers in the system is given by E(B) = P 00 ξ 1 + (c d)p 01 e 1 + P 1 ξ 4. (22) The expected number of idle servers in the system is given by E(I) = P 00 [(c d)e 0 ξ 1 ] + P 1 (ce 1 ξ 4 ). (23)
11 138 The Sixth International Symposium on Operations Research and Its Applications Proof. ote that E() = E( q ) = E(V ) = n=0 np 0 (n) + n=c d+1 n=0 dp 0 (n). n=c d+1 np 1 (n), (n c + d)p 0 (n) + n=c+1 (n c)p 1 (n), Substituting P 0 (n) of Eq. (17) and P 1 (n) of Eq. (18) into the equations above, we obtain the results given by Eqs. (19), (20) and (21). It is easy to see that E(B) = E() E( q ). (24) Substituting Eqs. (19) and (20) into the equation above yields Eq. (22). ote that E(I) = c E(B) E(V ), (25) the result for E(I) given by Eq. (23) is obtained by substituting Eqs. (21) and (24) into the equations above. Theorem 6. The average balking rate is given by B.R. = λ{(1 b c d )P 00 ε c d + P 01 ξ 5 + P 1 ξ 6 }. (26) The average reneging rate is given by R.R. = α{p 01 [ξ 2 (c d)e 0 ] + P 1 ξ 3 }. (27) The average rate of customer loss is given by L.L. = λ{(1 b c d )P 00 ε c d + P 01 ξ 5 + P 1 ξ 6 } +α{p 01 [ξ 2 (c d)e 0 ] + P 1 ξ 3 }. (28) Proof. Since the probability that a customer balks in the system is 1 b n when the customer on arrival finds n customers in the system, then the instantaneous balking rate is λ(1 b n ). Following the model of Ancker and Gafarian [6], the average balking rate B.R. is given by B.R. = n=c d λ(1 b n )P 0 (n) + n=c λ(1 b n )P 1 (n). Substituting P 0 (n) of Eq. (17) and P 1 (n) of Eq. (18) into the equation above yields Eq. (26).
12 Performance Analysis of an M/M/c/ Queueing System 139 If there are n customers in the system and i servers available, then there are n i waiting customers in the queue. Since any one of the n i customers in the queue may renege, the instantaneous reneging rate is (n i)α. Again, following the model of Ancker and Gafarian [6], the average reneging rate R.R. is given by R.R. = n=c d+1 (n c + d)αp 0 (n) + n=c+1 (n c)αp 1 (n) = αe( q ). Substituting E( q ) of Eq. (20) yields Eq. (27). The average rate of customer loss, L.R., is simply the sum of the average balking rate and the average reneging rate. Thus, we have L.R. = B.R. + R.R. Then, Eq. (28) is obtained by substituting Eqs. (26) and (27) into the equation above. 4.2 Cost model In this subsection, we develop an expected cost function where the number of servers on vacation d is a decision variable. Our objective is to determine the optimum number of servers on vacation d to minimize this cost function. Let C 1 cost per unit time when one server is on vacation, C 2 cost per unit time when one server is idle, C 3 cost per unit time when one server is busy, C 4 cost per unit time when one customer is waiting for service, C 5 cost per unit time when one customer joins the system and is served, C 6 cost per unit time when a customer balks or reneges. According to the definitions of each cost element listed above, the total expected cost function per unit time is given by F(d) = C 1 E(V ) +C 2 E(I) +C 3 E(B) +C 4 E( q ) +C 5 (E() E( q )) +C 6 L.L. or equivalently F(d) = C 1 E(V ) +C 2 E(I) + (C 3 +C 5 )E(B) +C 4 E( q ) +C 6 L.L. where E(V ), E(I), E(B) and E( q ) are given in Theorem 5, and L.L. is given in Theorem 6. 5 umerical Results In this subsection, we perform a sensitivity analysis on the optimal number of servers on vacation d and its expected cost F(d ) based on changes in the values of
13 140 The Sixth International Symposium on Operations Research and Its Applications the system parameters such as the arrival rate λ, the service rate µ, the reneging rate α and the vacation rate η. Since the decision variable d is an integer value and the expected cost function is non-linear and complex, it would be an arduous task to derive analytic results for the optimal value d. Thus, we use a heuristic approach to obtain the optimal value d which is determined by satisfying the following inequality: F(d 1) > F(d ) < F(d + 1). We set the system capacity = 10 and the number of servers c = 4. We select the probability b 0 = 0.95 and b n = 1 n/ for 1 n by referencing [6], and employ the following cost elements by referencing [9]: C 1 = 100, C 2 = 110, C 3 = 120, C 4 = 150, C 5 = 130 and C 6 = 140. The numerical results for the optimal value d and the optimal cost F(d ) are illustrated in Figs In Fig. 1, we fix µ = 1.0, η = 0.3 and α = 0.2, and display the optimal critical value d and the optimal cost F(d ) by varying the arrival rate λ. Fig. 1 shows that the optimal value d decreases as λ increases, while the optimal cost F(d ) increases significantly as λ increases. 700 Optimal Cost and Optimal umber of Servers on Vacation Optimal Cost F(d * ) Optimal umber of Servers on Vacation 100 d * Arriving Rate Figure 1: Optimal cost F(d ) and optimal value d versus arrive rate λ with µ 1 = 1.0, η = 0.3 and α = 0.2. In Fig. 2, we fix λ = 0.5, η = 0.3 and α = 0.2, and display the optimal critical value d and the optimal cost F(d ) by varying the service rate µ. Fig. 2 shows that the optimal value d increases as µ increases, while the optimal cost F(d ) decreases significantly as µ increases.
14 Performance Analysis of an M/M/c/ Queueing System 141 Optimal Cost and Optimal umber of Servers on Vacation Optimal Cost F(d * ) Optimal number of Servers on Vacation 100 d * Service Rate Figure 2: Optimal cost F(d ) and optimal value d versus service rate µ with λ = 0.5, η = 0.3 and α = 0.2. In Fig. 3, we fix λo.5, µ = 1 and η = 0.3, and display the optimal critical value d and the optimal cost F(d ) by varying the reneging rate α. Fig. 3 shows that the optimal value d increases as α increases, while the optimal cost F(d ) decreases slightly as α increases. In Fig. 4, we fix λ = 0.5, µ = 1.0 and α = 0.2, and display the optimal critical value d and the optimal cost F(d ) by varying the vacation rate η. Fig. 4 shows that the optimal value d increases as η increases, while the optimal cost F(d ) decreases slightly as η increases. It appears from Figs. 1-4 that: (i) The arrival rate λ and the service rate µ affect the optimal value d and the optimal cost F(d ) significantly. (ii) The reneging rate α and the vacation rate η affect the optimal value d and the optimal cost F(d ) slightly. 6 Conclusions In this paper, we have considered an M/M/c/ queueing system with balking, reneging and synchronous vacations of partial servers. We have developed the equations of the steady state probabilities and derived the matrix form solution for the steady-state probability vector. Based on the steady-state probability vector, we have obtained some performance measures of the system and formulated a cost model to determine the optimal number of servers on vacation. Furthermore, we have performed sensitivity analysis through numerical experiments.
15 142 The Sixth International Symposium on Operations Research and Its Applications 800 Optimal Cost and Optimal umber of Servers on Vacation Optimal Cost F(d * ) Optimal umber of Servers on Vacation 100 d * Reneging Rate Figure 3: Optimal cost F(d ) and optimal value d versus reneging rate α with λ = 0.5, µ = 1.0 and η = Optimal Cost and Optimal umber of Servers on Vacation Optimal Cost F(d * ) Optimal umber of Servers on Vacation 100 d * Vacation Rate Figure 4: Optimal cost F(d ) and optimal value d versus vacation rate η with λ = 0.5, µ = 1.0 and α = 0.2.
16 Performance Analysis of an M/M/c/ Queueing System 143 Acknowledgements This work was supported in part by the ational atural Science Foundation of China (o ) and the atural Science Foundation of Hebei Province (o. A ), China, and was supported in part by GRAT-I-AID FOR SCIETIFIC RESEARCH (o ) and MEXT.ORC ( ), Japan. References [1] J-C. Ke and K-H. Wang. The reliability analysis of balking and reneging in a repairable system with warm standbys. Quality and reliability Engineering International, 18, , [2] A. Shawky. The machine interference model: M/M/C/K/ with balking, reneging and spares. Opsearch, 37, 25 35, [3] Jr., C. Ancker and A. Gafarian. Queueing with impatient customers who leave at random. Journal of Industry Engineering, XIII, 84 90, [4] F. Haight. Queueing with balking. Biometrika, 44, , [5] F. Haight. Queueing with reneging. Metrika, 2, , [6] Jr., C. Ancker and A. Gafarian, Some queueing problems with balking and reneging: I. Operations Research, 11, , [7] Jr., C. Ancker and A. Gafarian. Some queueing problems with balking and reneging: II. Operations Research, 11, , [8] M. Abou El-Ata and A. Hariri. The M/M/C/ queue with balking and reneging. Computers and Operations Research, 19, , [9] K-H. Wang and Y-C. Chang. Cost analysis of a finite M/M/R queueing system with balking, reneging and server breakdowns. Mathematical Methods of Operations Research, 56(2), , [10] B. Doshi. Single server queues with vacation: a survey. Queueing System, 1(1), 29 66, [11] B. Doshi. Single server queues with vacations. In, H. Takagi (Ed.), Stochastic Analysis of Computer and Communication Systems, orth-holland, , [12] H. Takagi. Queueing Analysis, A Foundation of Performance Evaluation, Volume 1: Vacation and Priority Systems, Elsevier, [13] Y. Zhang, D. Yue and W. Yue. Analysis of an M/M/1/ queue with balking, reneging and server vacations. Proc. of the Fifth International Symposium, 37 47, [14] Z. Zhang and. Tian. Analysis on queueing systems with synchronous vacations of partial servers. Performance Evaluation, 52, , 2003.
Analysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations
Analysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations Yan Zhang 1 Dequan Yue 1 Wuyi Yue 2 1 College of Science, Yanshan University, Qinhuangdao 066004 PRChina 2 Department of Information
More informationInternational Journal of Pure and Applied Mathematics Volume 28 No ,
International Journal of Pure and Applied Mathematics Volume 28 No. 1 2006, 101-115 OPTIMAL PERFORMANCE ANALYSIS OF AN M/M/1/N QUEUE SYSTEM WITH BALKING, RENEGING AND SERVER VACATION Dequan Yue 1, Yan
More informationAnalysis of a Machine Repair System with Warm Spares and N-Policy Vacations
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) ijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 190 198 Analysis of a Machine Repair System
More informationAnalysis of a Two-Phase Queueing System with Impatient Customers and Multiple Vacations
The Tenth International Symposium on Operations Research and Its Applications (ISORA 211) Dunhuang, China, August 28 31, 211 Copyright 211 ORSC & APORC, pp. 292 298 Analysis of a Two-Phase Queueing System
More informationA Heterogeneous Two-Server Queueing System with Balking and Server Breakdowns
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 230 244 A Heterogeneous Two-Server Queueing
More informationEQUILIBRIUM STRATEGIES IN AN M/M/1 QUEUE WITH SETUP TIMES AND A SINGLE VACATION POLICY
EQUILIBRIUM STRATEGIES IN AN M/M/1 QUEUE WITH SETUP TIMES AND A SINGLE VACATION POLICY Dequan Yue 1, Ruiling Tian 1, Wuyi Yue 2, Yaling Qin 3 1 College of Sciences, Yanshan University, Qinhuangdao 066004,
More informationReview Paper Machine Repair Problem with Spares and N-Policy Vacation
Research Journal of Recent Sciences ISSN 2277-2502 Res.J.Recent Sci. Review Paper Machine Repair Problem with Spares and N-Policy Vacation Abstract Sharma D.C. School of Mathematics Statistics and Computational
More informationMultiserver Queueing Model subject to Single Exponential Vacation
Journal of Physics: Conference Series PAPER OPEN ACCESS Multiserver Queueing Model subject to Single Exponential Vacation To cite this article: K V Vijayashree B Janani 2018 J. Phys.: Conf. Ser. 1000 012129
More informationStationary Analysis of a Multiserver queue with multiple working vacation and impatient customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 2, Issue 2 (December 207), pp. 658 670 Applications and Applied Mathematics: An International Journal (AAM) Stationary Analysis of
More informationInternational Journal of Informative & Futuristic Research ISSN:
Research Paper Volume 3 Issue 2 August 206 International Journal of Informative & Futuristic Research ISSN: 2347-697 Analysis Of FM/M//N Queuing System With Reverse Balking And Reverse Reneging Paper ID
More informationA Heterogeneous two-server queueing system with reneging and no waiting line
ProbStat Forum, Volume 11, April 2018, Pages 67 76 ISSN 0974-3235 ProbStat Forum is an e-journal. For details please visit www.probstat.org.in A Heterogeneous two-server queueing system with reneging and
More informationPerishable Inventory System at Service Facilities with Multiple Server Vacations and Impatient Customers
J. Stat. Appl. Pro. Lett. 3, o. 3, 63-73 (2014) 63 Journal of Statistics Applications & Probability Letters An International Journal http://dx.doi.org/10.12785/jsapl/010303 Perishable Inventory System
More informationCost Analysis of a vacation machine repair model
Available online at www.sciencedirect.com Procedia - Social and Behavioral Sciences 25 (2011) 246 256 International Conference on Asia Pacific Business Innovation & Technology Management Cost Analysis
More informationThe discrete-time Geom/G/1 queue with multiple adaptive vacations and. setup/closedown times
ISSN 1750-9653, England, UK International Journal of Management Science and Engineering Management Vol. 2 (2007) No. 4, pp. 289-296 The discrete-time Geom/G/1 queue with multiple adaptive vacations and
More informationSystem with a Server Subject to Breakdowns
Applied Mathematical Sciences Vol. 7 213 no. 11 539 55 On Two Modifications of E 2 /E 2 /1/m Queueing System with a Server Subject to Breakdowns Michal Dorda VSB - Technical University of Ostrava Faculty
More informationAn M/M/1/N Queuing system with Encouraged Arrivals
Global Journal of Pure and Applied Mathematics. ISS 0973-1768 Volume 13, umber 7 (2017), pp. 3443-3453 Research India Publications http://www.ripublication.com An M/M/1/ Queuing system with Encouraged
More informationOutline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.
Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]
More informationTime Dependent Solution Of M [X] /G/1 Queueing Model With second optional service, Bernoulli k-optional Vacation And Balking
International Journal of Scientific and Research Publications,Volume 3,Issue 9, September 213 ISSN 225-3153 1 Time Dependent Solution Of M [X] /G/1 Queueing Model With second optional service, Bernoulli
More informationReliability of an (M, M) Machining System with Spares
Reliability of an (M, M) Machining System with Spares Rashmita Sharma Department of Mathematics D.A.V. (P.G.) College, Dehradun-248001 (India). Abstract This paper studies the reliability characteristics
More informationTwo Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server
Two Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server S. Jehoashan Kingsly 1, S. Padmasekaran and K. Jeganathan 3 1 Department of Mathematics, Adhiyamaan
More informationOptimal Strategy Analysis of N-Policy M/M/1 Vacation Queueing System with Server Start-Up and Time-Out
International Journal of Engineering Science Invention ISSN (Online): 319 6734, ISSN (rint): 319 676 Volume 6 Issue 11 November 017. 4-8 Optimal Strategy Analysis of N-olicy M/M/1 Vacation Queueing System
More informationPerformance Analysis and Evaluation of Digital Connection Oriented Internet Service Systems
Performance Analysis and Evaluation of Digital Connection Oriented Internet Service Systems Shunfu Jin 1 and Wuyi Yue 2 1 College of Information Science and Engineering Yanshan University, Qinhuangdao
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationCost Analysis of Two-Phase M/M/1 Queueing system in the Transient state with N-Policy and Server Breakdowns
IN (e): 2250 3005 Volume, 07 Issue, 9 eptember 2017 International Journal of Computational Engineering Research (IJCER) Cost Analysis of Two-Phase M/M/1 Queueing system in the Transient state with N-Policy
More informationNon-Persistent Retrial Queueing System with Two Types of Heterogeneous Service
Global Journal of Theoretical and Applied Mathematics Sciences. ISSN 2248-9916 Volume 1, Number 2 (211), pp. 157-164 Research India Publications http://www.ripublication.com Non-Persistent Retrial Queueing
More informationA Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time
A Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time E. Ramesh Kumar 1, L. Poornima 2 1 Associate Professor, Department of Mathematics, CMS College of Science
More informationJau-Chuan Ke 1, Ssu-Lang Lee 2 and Cheng-Hwai Liou 2
RAIRO-Oper. Res. 43 (2009) 35 54 DOI: 10.1051/ro/2009004 RAIRO Operations Research www.rairo-ro.org MACHINE REPAIR PROBLEM IN PRODUCTION SYSTEMS WITH SPARES AND SERVER VACATIONS Jau-Chuan Ke 1, Ssu-Lang
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More information5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
More information4.7 Finite Population Source Model
Characteristics 1. Arrival Process R independent Source All sources are identical Interarrival time is exponential with rate for each source No arrivals if all sources are in the system. OR372-Dr.Khalid
More informationQueuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The
More informationAN ENHANCED ENERGY SAVING STRATEGY FOR AN ACTIVE DRX IN LTE WIRELESS NETWORKS. Received December 2012; revised April 2013
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 11, November 2013 pp. 4373 4387 AN ENHANCED ENERGY SAVING STRATEGY FOR AN
More informationQueuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.
Queuing Theory Introduction Waiting lines are the most frequently encountered problems in everyday life. For example, queue at a cafeteria, library, bank, etc. Common to all of these cases are the arrivals
More informationAn M/G/1 Retrial Queue with Non-Persistent Customers, a Second Optional Service and Different Vacation Policies
Applied Mathematical Sciences, Vol. 4, 21, no. 4, 1967-1974 An M/G/1 Retrial Queue with Non-Persistent Customers, a Second Optional Service and Different Vacation Policies Kasturi Ramanath and K. Kalidass
More informationChapter 1. Introduction. 1.1 Stochastic process
Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.
More informationTransient Solution of a Multi-Server Queue. with Catastrophes and Impatient Customers. when System is Down
Applied Mathematical Sciences, Vol. 8, 2014, no. 92, 4585-4592 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.45388 Transient Solution of a Multi-Server Queue with Catastrophes and Impatient
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationA Joining Shortest Queue with MAP Inputs
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 25 32 A Joining Shortest Queue with
More informationM/M/3/3 AND M/M/4/4 RETRIAL QUEUES. Tuan Phung-Duc, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
JOURNAL OF INDUSTRIAL AND doi:10.3934/imo.2009.5.431 MANAGEMENT OPTIMIZATION Volume 5, Number 3, August 2009 pp. 431 451 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES Tuan Phung-Duc, Hiroyuki Masuyama, Shoi Kasahara
More informationChapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationM/M/1 Queueing System with Delayed Controlled Vacation
M/M/1 Queueing System with Delayed Controlled Vacation Yonglu Deng, Zhongshan University W. John Braun, University of Winnipeg Yiqiang Q. Zhao, University of Winnipeg Abstract An M/M/1 queue with delayed
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationPBW 654 Applied Statistics - I Urban Operations Research
PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization
More informationAn M/M/1 Queue in Random Environment with Disasters
An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,
More informationM/M/1 TWO-PHASE GATED QUEUEING SYSTEM WITH UNRELIABLE SERVER AND STATE DEPENDENT ARRIVALS
Int. J. Chem. Sci.: 14(3), 2016, 1742-1754 ISSN 0972-768X www.sadgurupublications.com M/M/1 TWO-PHASE GATED QUEUEING SYSTEM WITH UNRELIABLE SERVER AND STATE DEPENDENT ARRIVALS S. HANUMANTHA RAO a*, V.
More informationGeom/G 1,G 2 /1/1 REPAIRABLE ERLANG LOSS SYSTEM WITH CATASTROPHE AND SECOND OPTIONAL SERVICE
J Syst Sci Complex (2011) 24: 554 564 Geom/G 1,G 2 /1/1 REPAIRABLE ERLANG LOSS SYSTEM WITH CATASTROPHE AND SECOND OPTIONAL SERVICE Yinghui TANG Miaomiao YU Cailiang LI DOI: 10.1007/s11424-011-8339-2 Received:
More informationResearch Article Binomial Schedule for an M/G/1 Type Queueing System with an Unreliable Server under N-Policy
Advances in Decision Sciences, Article ID 819718, 6 pages http://dx.doi.org/10.1155/2014/819718 Research Article Binomial Schedule for an M/G/1 Type Queueing System with an Unreliable Server under N-Policy
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationA Two Phase Service M/G/1 Vacation Queue With General Retrial Times and Non-persistent Customers
Int. J. Open Problems Compt. Math., Vol. 3, No. 2, June 21 ISSN 1998-6262; Copyright c ICSRS Publication, 21 www.i-csrs.org A Two Phase Service M/G/1 Vacation Queue With General Retrial Times and Non-persistent
More informationInventory Ordering Control for a Retrial Service Facility System Semi- MDP
International Journal of Engineering Science Invention (IJESI) ISS (Online): 239 6734, ISS (Print): 239 6726 Volume 7 Issue 6 Ver I June 208 PP 4-20 Inventory Ordering Control for a Retrial Service Facility
More informationIntroduction to Queueing Theory with Applications to Air Transportation Systems
Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority
More informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More informationEquilibrium solutions in the observable M/M/1 queue with overtaking
TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES, DEPARTMENT OF STATISTICS AND OPERATION RESEARCH Equilibrium solutions in the observable M/M/ queue
More informationIOE 202: lectures 11 and 12 outline
IOE 202: lectures 11 and 12 outline Announcements Last time... Queueing models intro Performance characteristics of a queueing system Steady state analysis of an M/M/1 queueing system Other queueing systems,
More information1 Markov decision processes
2.997 Decision-Making in Large-Scale Systems February 4 MI, Spring 2004 Handout #1 Lecture Note 1 1 Markov decision processes In this class we will study discrete-time stochastic systems. We can describe
More informationQueueing Analysis of a Multi-component Machining System having Unreliable Heterogeneous Servers and Impatient Customers
American Journal of Operational Research 0,(3): - DOI: 0.593/j.ajor.0003.0 Queueing Analysis of a Multi-component Machining System having Unreliable Heterogeneous Servers and Impatient Customers M. Jain,
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More informationA Vacation Queue with Additional Optional Service in Batches
Applied Mathematical Sciences, Vol. 3, 2009, no. 24, 1203-1208 A Vacation Queue with Additional Optional Service in Batches S. Pazhani Bala Murugan Department of Mathematics, Annamalai University Annamalainagar-608
More informationThe effect of probabilities of departure with time in a bank
International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper
More informationA FAST MATRIX-ANALYTIC APPROXIMATION FOR THE TWO CLASS GI/G/1 NON-PREEMPTIVE PRIORITY QUEUE
A FAST MATRIX-ANAYTIC APPROXIMATION FOR TE TWO CASS GI/G/ NON-PREEMPTIVE PRIORITY QUEUE Gábor orváth Department of Telecommunication Budapest University of Technology and Economics. Budapest Pf. 9., ungary
More informationarxiv: v1 [math.pr] 3 Apr 2016
Performance analysis of Markovian queue with impatience and vacation times arxiv:164.2449v1 math.pr] 3 Apr 216 Assia Boumahdaf Laboratoire de Statistique Théorique et Appliquée Université Pierre et Marie
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationChapter 3: Markov Processes First hitting times
Chapter 3: Markov Processes First hitting times L. Breuer University of Kent, UK November 3, 2010 Example: M/M/c/c queue Arrivals: Poisson process with rate λ > 0 Example: M/M/c/c queue Arrivals: Poisson
More informationBatch Arrival Queuing Models with Periodic Review
Batch Arrival Queuing Models with Periodic Review R. Sivaraman Ph.D. Research Scholar in Mathematics Sri Satya Sai University of Technology and Medical Sciences Bhopal, Madhya Pradesh National Awardee
More informationChapter 5: Special Types of Queuing Models
Chapter 5: Special Types of Queuing Models Some General Queueing Models Discouraged Arrivals Impatient Arrivals Bulk Service and Bulk Arrivals OR37-Dr.Khalid Al-Nowibet 1 5.1 General Queueing Models 1.
More informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationEfficient Graduate Employment Serving System based on Queuing Theory
76 JOURA OF COMUERS, VO. 7, O. 9, SEEMBER Efficient Graduate Employment Serving System based on Queuing heory Zeng Hui School of Sciences, Yanshan University, Qinhuangdao, China Email: zenghui @ysu.edu.cn
More informationRetrial queue for cloud systems with separated processing and storage units
Retrial queue for cloud systems with separated processing and storage units Tuan Phung-Duc Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro-ku, Tokyo, Japan
More informationMonotonicity Properties for Multiserver Queues with Reneging and Finite Waiting Lines
Monotonicity Properties for Multiserver Queues with Reneging and Finite Waiting Lines Oualid Jouini & Yves Dallery Laboratoire Génie Industriel, Ecole Centrale Paris Grande Voie des Vignes, 92295 Châtenay-Malabry
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationOnline Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates
Online Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates Xu Sun and Ward Whitt Department of Industrial Engineering and Operations Research, Columbia University
More informationStochastic Models of Manufacturing Systems
Stochastic Models of Manufacturing Systems Ivo Adan Systems 2/49 Continuous systems State changes continuously in time (e.g., in chemical applications) Discrete systems State is observed at fixed regular
More informationAn M/M/1 Retrial Queue with Unreliable Server 1
An M/M/1 Retrial Queue with Unreliable Server 1 Nathan P. Sherman 2 and Jeffrey P. Kharoufeh 3 Department of Operational Sciences Air Force Institute of Technology Abstract We analyze an unreliable M/M/1
More informationNetworks of Queues Models with Several. Classes of Customers and Exponential. Service Times
Applied Mathematical Sciences, Vol. 9, 2015, no. 76, 3789-3796 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.53287 Networks of Queues Models with Several Classes of Customers and Exponential
More informationA Simple Solution for the M/D/c Waiting Time Distribution
A Simple Solution for the M/D/c Waiting Time Distribution G.J.Franx, Universiteit van Amsterdam November 6, 998 Abstract A surprisingly simple and explicit expression for the waiting time distribution
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationINDEX. production, see Applications, manufacturing
INDEX Absorbing barriers, 103 Ample service, see Service, ample Analyticity, of generating functions, 100, 127 Anderson Darling (AD) test, 411 Aperiodic state, 37 Applications, 2, 3 aircraft, 3 airline
More informationOPTIMAL CONTROL OF A FLEXIBLE SERVER
Adv. Appl. Prob. 36, 139 170 (2004) Printed in Northern Ireland Applied Probability Trust 2004 OPTIMAL CONTROL OF A FLEXIBLE SERVER HYUN-SOO AHN, University of California, Berkeley IZAK DUENYAS, University
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationQueueing Systems with Customer Abandonments and Retrials. Song Deng
Queueing Systems with Customer Abandonments and Retrials by Song Deng A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Engineering - Industrial
More informationA Nonlinear Programming Approach For a Fuzzy queue with an unreliable server Dr.V. Ashok Kumar
The Bulletin of Society for Mathematical Services and Standards Online: 2012-06-04 ISSN: 2277-8020, Vol. 2, pp 44-56 doi:10.18052/www.scipress.com/bsmass.2.44 2012 SciPress Ltd., Switzerland A Nonlinear
More informationStochastic inventory system with two types of services
Int. J. Adv. Appl. Math. and Mech. 2() (204) 20-27 ISSN: 2347-2529 Available online at www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Stochastic inventory system
More informationSystem occupancy of a two-class batch-service queue with class-dependent variable server capacity
System occupancy of a two-class batch-service queue with class-dependent variable server capacity Jens Baetens 1, Bart Steyaert 1, Dieter Claeys 1,2, and Herwig Bruneel 1 1 SMACS Research Group, Dept.
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationPreemptive Resume Priority Retrial Queue with. Two Classes of MAP Arrivals
Applied Mathematical Sciences, Vol. 7, 2013, no. 52, 2569-2589 HIKARI Ltd, www.m-hikari.com Preemptive Resume Priority Retrial Queue with Two Classes of MAP Arrivals M. Senthil Kumar 1, S. R. Chakravarthy
More informationDynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement
Submitted to imanufacturing & Service Operations Management manuscript MSOM-11-370.R3 Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement (Authors names blinded
More informationChapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.
8. Preliminaries L, L Q, W, W Q L = average number of customers in the system. L Q = average number of customers waiting in queue. W = average number of time a customer spends in the system. W Q = average
More informationThe Impact of Disruption Characteristics on the Performance of a Server
The Impact of Disruption Characteristics on the Performance of a Server Pedram Sahba University of Toronto, Department of Mechanical and Industrial Engineering 5 King s College Rd., Toronto, ON M5S 3G8,
More informationQueuing Analysis of Markovian Queue Having Two Heterogeneous Servers with Catastrophes using Matrix Geometric Technique
International Journal of Statistics and Systems ISSN 0973-2675 Volume 12, Number 2 (2017), pp. 205-212 Research India Publications http://www.ripublication.com Queuing Analysis of Markovian Queue Having
More informationContents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory
Contents Preface... v 1 The Exponential Distribution and the Poisson Process... 1 1.1 Introduction... 1 1.2 The Density, the Distribution, the Tail, and the Hazard Functions... 2 1.2.1 The Hazard Function
More informationM/M/1 Retrial Queueing System with N-Policy. Multiple Vacation under Non-Pre-Emtive Priority. Service by Matrix Geometric Method
Applied Mathematical Sciences, Vol. 4, 2010, no. 23, 1141 1154 M/M/1 Retrial Queueing System with N-Policy Multiple Vacation under Non-Pre-Emtive Priority Service by Matrix Geometric Method G. AYYAPPAN
More informationSTEADY-STATE BEHAVIOR OF AN M/M/1 QUEUE IN RANDOM ENVIRONMENT SUBJECT TO SYSTEM FAILURES AND REPAIRS. S. Sophia 1, B. Praba 2
International Journal of Pure and Applied Mathematics Volume 101 No. 2 2015, 267-279 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v101i2.11
More informationCross-Selling in a Call Center with a Heterogeneous Customer Population. Technical Appendix
Cross-Selling in a Call Center with a Heterogeneous Customer opulation Technical Appendix Itay Gurvich Mor Armony Costis Maglaras This technical appendix is dedicated to the completion of the proof of
More informationQueueing Theory (Part 4)
Queueing Theory (Part 4) Nonexponential Queueing Systems and Economic Analysis Queueing Theory-1 Queueing Models with Nonexponential Distributions M/G/1 Model Poisson input process, general service time
More information