Balking and Re-service in a Vacation Queue with Batch Arrival and Two Types of Heterogeneous Service
|
|
- Elwin Chase
- 5 years ago
- Views:
Transcription
1 Journal of Mathematics Research; Vol. 4, No. 4; 212 ISSN E-ISSN Publishe by Canaian Center of Science an Eucation Balking an Re-service in a Vacation Queue with Batch Arrival an Two Types of Heterogeneous Service 1 Brunel University, UK Monita Baruah 1, Kailash C. Maan 2 & Tillal Elabi 3 2 College of Information Technology, Ahlia University, Kingom of Bahrain 3 Brunel Business School, Brunel University, UK Corresponence: Monita Baruah, Department of Mathematics, University of Bahrain, Kingom of Bahrain. Monita.Baruah@brunel.ac.uk, monitabrh@gmail.com Receive: June 17, 212 Accepte: July 2, 212 Online Publishe: July 26, 212 oi:1.5539/jmr.v4n4p114 URL: Abstract In this paper we have consiere a single server queue with customers or units arriving in groups or batches in a system proviing two types of general heterogeneous service. The server provies type 1 or type 2 services on a first come first serve basis. At the beginning of a service, a customer has the option to choose either type 1 or type 2 service. Also we ae the concept of balking an re-service in this stuy. Balking is a kin of customer behavior. If a batch on arrival for service is reluctant or refuses to join the system for some reasons is sai to balk. Once a service is complete the customer may leave the system or he has the option to eman re-service for the same service taken. Further as soon as service of any type gets complete, the server may take vacation or continue staying at the system even if the system is empty. For this moel we have erive the steay state queue size istribution at ranom epoch an some particular cases have been evelope an compare with known results. Keywors: batch arrivals, general heterogeneous service, balking, vacations, queue size istribution, waiting time 1. Introuction Research stuies on queues with batch arrival an vacations have been increase tremenously an still many researchers have been eveloping on the theory of ifferent aspects of queuing. Queuing is an important phenomenon in the real life, be it human or virtual queues an eminent researchers have been eveloping theories on queuing moels since 195. Research authors like Baba (1986), Lee et al. (1994; 1995), Doshi (1986) an Takagi (199) were the pioneers in this fiel. We can fin vast literature on the extensive amount of stuies been one on ifferent queuing moels with server vacations, arrival pattern an customers behavior. Stuies on queues with vacations an breakown ha been one by authors like Borthakur an Chouhury (1997; 2; 24), Maan (1995; 2; 21), Maan an Dayyeh (22), Chouhury an Maan (27). Many of the authors here have stuie single server with ifferent vacation policies. Queues with vacations an restricte amissibility of customers have been stuie by Chouhury (27) an Maan (2). In our moel we assume customers arriving in batches an the system is proviing in parallel two types of general heterogeneous service, the customer can choose any one type of service. We can fin many real life applications of this moel. Such situations are mostly observe in fuel stations, banks, post offices etc. where the customer has option of choosing any one kin of service. The concept of balking was first stuie by Haight in the year 1957, since then consierable attention has been given on many queuing theories with customer impatience. In our moel we assume that arrival units may refuse to join the system (balks) by estimating the uration of waiting time for a service to get complete or by witnessing the long length of the queue. In queuing literature, queues with vacations an behavior of impatient customers have been stuie by many for mainly single server but balking in case of two parallel servers for a general istribution has still not been worke on. Re-service is also an important factor in the theory of queuing system an have many applications in the real worl. There may be situations where re-service is esire, for instance while visiting a octor, the patient may be 114
2 Journal of Mathematics Research Vol. 4, No. 4; 212 recommene for some investigations, after which he may nee to see the octor again while in some situations offering public service a customer may fin his service unsatisfactory an consequently eman re-service. We fin many real life applications of queues with balking an re-service in sectors as telecommunication, computer networking, call centers, inventory an prouction, maintenance an quality control in inustrial organisations etc. Though in the queuing literature we fin limite stuies on queuing system with re-service, we refer to some type of queuing networks incluing cyclic queuing systems with feeback stuie by authors like Glenbe an Pujolle (1987) an Maan (1988). In fact, authors like Maan et al. (24), Jeyakumar an Arumuganathan (211) stuie queues with re-service. Here we have iscusse the case of optional re-service. In this case a customer has the choice of selecting any one of the two types of heterogeneous service, subsequently has the option to repeat the service taken by him or epart from the system. The mathematical moel has been efine uner the following assumptions. 2. Mathematical Moel Here we assume that customers (units) arrive in batches of variable size accoring following a compoun Poisson Process. Let λc i t (i = 1, 2, 3,...) be the first orer probability of arrival of i customers in batches in the system at a short interval of time (t, t + t where c i 1, i=1 c i = 1, λ>is the mean arrival rate of batches. We consier the case when there is a single server proviing parallel service of two types on a first come first serve basis (FCFS). At the start of the service, each customer has the choice of choosing either first service with probability ξ 1 or can choose secon service with probability ξ 2 an ξ 1 + ξ 2 = 1. We assume that the ranom variable of service time s j ( j = 1, 2) of the jth kin of service follows a general probability law with istribution function H j (s j ), h j (s j ) is the probability ensity function an E(s K j )isthekth moment (k = 1, 2,...) of service time, j = 1, 2. Let μ j (x) be the conitional probability of type j service uring the perio (x, x + x given that elapse time is x, so that an μ j (x) = h j (x) = μ j (s j )exp h j (x), j = 1, 2 (1) 1 H j (x) s μ j (x)x, j = 1, 2. (2) Once the service of a customer is complete, the server may ecie to take vacation with probability q or may continue to serve the next customer with probability (1 q) or may remain ile in the system even if there is no customer requiring service. Further we assume that the vacation time ranom variable follow general probability law with istribution function V(x), v(x)the probability ensity an E(V K )asthekth moment, k = 1, 2,... Let φ(x) be the conitional probability of a vacation perio uring the interval (x, x + x given elapse time is x, so that an φ(x) = v(y) = φ(y)exp V(x) 1 V(x) v φ(x)x Also we assume that (1 a 1 )( a 1 1) is the probability that an arriving batch balks uring the perio when the server is busy (available on the system) an (1 a 2 )( a 2 1) is the probability that an arriving batch balks uring the perio when server is on vacation. As soon as service (of any one kin) is complete he has the option to leave the system or join the system for reservice, if necessary. We assume that probability of repeating type j service as r j an leaving the system without re-service as (1 r j ), j = 1, 2. We consier that either service maybe repeate only once. 3. Definitions an Notations Assuming that steay state exists, we efine (3) (4) 115
3 Journal of Mathematics Research Vol. 4, No. 4; 212 P n, j (x) = Probability that there are n( 1) customers in the system incluing one customer in type j service, j = 1, 2 an elapse service time is x. Thus P n, j = P n, j (x)x is the corresponing steay state probability irrespective of elapse time x. R n, j (x) = Probability that there are n( 1) customers in the system incluing one customer who is repeating type j service, j = 1, 2 an elapse service time is x. Thus R n, j = R n, j (x)x is the corresponing steay state probability irrespective of elapse service time x. W n (x) = probability that there are n( ) customers in the queue an server is on vacation an elapse vacation time is x. W n = W n (x)x is the corresponing steay state probability irrespective of elapse vacation time x. E = Steay state probability of the server is ile but available in the system an there is no customer requiring service. The Probability Generating Functions are efine as: P j (x, z) = z n P n, j (x); P j (z) = z n P n, j, z 1; j = 1, 2 (5) n=1 n=1 n=1 R j (x, z) = z n R n, j (x); R j (z) = z n R n, j ; z 1; j = 1, 2 (6) n= n=1 W(x, z) = z n W n (x); W(z) = z n W n ; z 1 (7) C(z) = 4. Equations Governing the System Let us efine the steay state equations for our moel as n= x P n,1(x) + (λ + μ 1 (x))p n,1 (x) = λ(1 a 1 )P n,1 (x) + a 1 λ x P n,2(x) + (λ + μ 2 (x)) P n,2 (x) = λ(1 a 1 )P n,2 (x) + a 1 λ x R n,1(x) + (λ + μ 1 (x))r n,1 (x) = λ(1 a 1 )R n,1 (x) + a 1 λ x R n,2(x) + (λ + μ 2 (x))r n,2 (x) = λ(1 a 1 )R n,2 (x) + a 1 λ x W n(x) + (λ + φ(x)) W n (x) = λ(1 a 2 )W n (x) + a 2 λ z i c i ; z 1 (8) i=1 n c i P n i,1 (x) (9) i=1 n c i P n i,2 (x) (1) i=1 c i R n i,1 (x) (11) i=1 c i R n i,2 (x) (12) i 1 n C i W n i (x) (13) x W (x) + (λ + φ(x))w (x) = λ(1 a 2 )W (x) (14) λe = λ(1 a 1 )E + (1 q) (1 r 1 ) P 1,1 (x)μ 1 (x)x + (1 r 2 ) P 1,2 (x)μ 2 (x)x +(1 q) R 1,1 (x)μ 1 (x)x + where P, j (x) =, R, j (x) =, j = 1, 2 for (9), (1), (11) an (12). R 1,2 (x)μ 2 (x)x + i=1 W (x)φ(x)x (15) The above equations is to be solve subject to the bounary conitions given below at x = : P n,1 () = (1 q)ξ 1 (1 r 1 ) P n+1,1 (x)μ 1 (x)x + (1 r 2 ) P n+1,2 (x)μ 2 (x)x 116
4 Journal of Mathematics Research Vol. 4, No. 4; 212 +(1 q)ξ 1 R n+1,1 (x)μ 1 (x)x + P n,2 () = (1 q)ξ 2 (1 r 1 ) +(1 q)ξ 2 R n+1,1 (x)μ 1 (x)x + W n () = q (1 r 1 ) an the normalizing conition R n+1,2 (x)μ 2 (x)x + ξ 1 W n (x)φ(x)x + λa 1 ξ 1 c n E, n 1 (16) P n+1,1 (x)μ 1 (x)x + (1 r 2 ) P n+1,2 (x)μ 2 (x)x R n+1,2 (x)μ 2 (x)x + ξ 2 W n (x)φ(x)x + λa 1 ξ 2 c n E, n 1 (17) R n,1 () = r 1 P n,1 (x)μ 1 (x)x (18) R n,2 () = r 2 P n,2 (x)μ 2 (x)x (19) P n+1,1 (x)μ 1 (x)x + (1 r 2 ) P n+1,2 (x)μ 2 (x)x (2) E + 2 j=1 n=1 P n, j (x)x + 2 j=1 n=1 R n, j (x)x + n= W n (x)x = 1 (21) 5. Queue Size Distribution at Ranom Epoch Now let us multiply Equations (9)-(13) by z n, an taking summations over all possible values of n an simplifying we get x P 1(x, z) + {a 1 (λ λc(z)) + μ 1 (x)}p 1 (x, z) = (22) x P 2(x, z) + {a 1 (λ λc(z)) + μ 2 (x)}p 2 (x, z) = (23) x R 1(x, z) + {a 1 (λ λc(z)) + μ 1 (x)}r 1 (x, z) = (24) x R 2(x, z) + {a 1 (λ λc(z)) + μ 2 (x)}r 2 (x, z) = (25) x W(x, z) + {a 2(λ λc(z)) + φ(x)}w(x, z) = (26) We now integrate Equations (22)-(26) between limits an x an obtain P 1 (x, z) = P 1 (, z)e a 1λ(1 C(z)) x μ 1(t)t (27) P 2 (x, z) = P 2 (, z)e a 1λ(1 C(z)) x μ 2(t)t R 1 (x, z) = R 1 (, z)e a 1λ(1 C(z)) x μ 1(t)t R 2 (x, z) = R 2 (, z)e a 1λ(1 C(z)) x μ 2(t)t (28) (29) (3) W(x, z) = W(, z)e a 2λ(1 C(z)) x φ(t)t,λ> (31) Next we multiply Equation (16) with appropriate powers of z, take summation over all possible values of n an using relations (15) an (27), after simplifying we obtain zp 1 (, z) = (1 q) ξ 1 (1 r1 ) +(1 q) ξ 1 P 1 (x, z) μ 1 (x) x + (1 r 2 ) P 2 (x, z) μ 2 (x, z) x R 1 (x, z) μ 1 (x) x + R 2 (x, z) μ 2 (x) x + zξ 1 W(x, z) φ(x) x + za 1 ξ 1 λ ( C(z) 1)E 117 (32)
5 Journal of Mathematics Research Vol. 4, No. 4; 212 We perform the same operations on Equations (17)-(2) an thus obtain zp 2 (, z) = (1 q)ξ 2 (1 r1 ) +(1 q) ξ 2 P 1 (x, z)μ 1 (x)x + (1 r 2 ) P 2 (x, z)μ 2 (x, z)x R 1 (x, z)μ 1 (x)x + R 2 (x, z)μ 2 (x)x (33) zw(, z) = q + z ξ 2 W(x, z) φ (x) x + za 1 ξ 2 λ ( C(z) 1)E (1 r 1 ) R n,1 () = r 1 P 1 (x, z)μ 1 (x)x (34) R n,2 () = r 2 P 2 (x, z)μ 2 (x)x (35) P 1 (x, z)μ 1 (x)x + (1 r 2 ) P 2 (x, z)μ 2 (x)x We now multiply Equations (27) an (29) by μ 1 (x) an Equations (28) an (3) by μ 2 (x), integrate by parts w.r.t. x, use Equation (2) to obtain (36) P 1 (x, z)μ 1 (x)x = P 1 (, z)h 1 (a 1(λ λc(z))) (37) P 2 (x, z)μ 2 (x)x = P 2 (, z) H 2 (a 1(λ λc(z))) (38) R 1 (x, z)μ 1 (x)x = R 1 (, z)h 1 (a 1(λ λc(z))) (39) R 2 (x, z)μ 2 (x)x = R 2 (, z)h 2 (a 1(λ λc(z))) (4) Similarly multiplying Equation (31) by φ(x)an applying the same operations as above, we get W(x, z)φ(x)x = W(, z)v (a 2 (λ λc(z))) (41) where H j (a 1(λ λc(z))) = e a1(λ λc(z) H j (x) is the Laplace-Transform of jth type of service, j = 1, 2 an V (a 2 (λ λc(z))) = e a2(λ λc(z)) V(x) is the Laplace-Transform of vacation time. Let us substitute relations (37)-(41) in Equations (32) an (33), thus we get or zp 1 (, z) = (1 q) ξ 1 (1 r1 )P 1 (, z)h 1 (a 1(λ λc(z)) ) + (1 r 2 )P 2 (, z)h 2 (a 1(λ λc(z)) ) + +(1 q) ξ 1 R1 (, z)h 1 (a 1(λ λc(z)) ) + R 2 (, z)h 2 (a 1(λ λc(z))) + zξ 1 W(, z) V (a 2 (λ λc(z)) ) +z λ a 1 ξ 1 ( C(z) 1) ) E zp 1 (, z) = (1 q) ξ 1 (1 r1 )P 1 (, z)h 1 (a 1(λ λc(z)) ) + (1 r 2 ) P 2 (, z)h 2 (a 1(λ λ C(z))) + (1 q) ξ 1 P1 (, z)(h 1 (a 1(λ λc(z)) ) 2 + P 2 (, z)(h 2 (a 1 (λ λ C(z)) ) 2 + z ξ 1 q ( 1 r 1 ) P 1 (, z) H 1 (a 1(λ λc(z)) ) + (1 r 2 ) P 2 (, z) H 2 (a 1 (λ λc(z))) ) V (a 2 (λ λc(z))) +z λ a 1 ξ 1 (C(z) 1 ) E (42) 118
6 Journal of Mathematics Research Vol. 4, No. 4; 212 Similarly zp 2 (, z) = (1 q)ξ 2 (1 r1 )P 1 (, z)h 1 (a 1(λ λc(z)) ) + (1 r 2 )P 2 (, z)h 2 (a 1(λ λc(z)) ) +(1 q)ξ 2 P1 (, z)(h 1 (a 1(λ λc(z))) 2 + P 2 (, z)(h 2 (a 1(λ λc(z))) 2 + z ξ 2 (1 r1 ) P 1 (, z) H 1 (a 1(λ λc(z))) + (1 r 2 )P 2 (, z)h 2 (a 1(λ λc(z))) V (a 2 (λ λc(z))) (43) +z λa 1 ξ 2 (C(z) 1)E R 1 (, z) = r 1 P 1 (, z) H1 (a 1(λ λc(z))) (44) R 2 (, z) = r 2 P 1 (, z)h2 (a 1(λ λc(z))) (45) zw(, z) = qp 1 (, z)h1 (a 1(λ λc(z))) + P 2 (, z)h2 (a 1(λ λc(z))) (46) Now solving (42) an (43) we get the following P 1 (, z) = zλa 1ξ 1 (1 C(z))E P 2 (, z) = zλa 1ξ 2 (1 C(z))E R 1 (, z) = zλa 1r 1 ξ 1 (1 C(z))H 1 (a 1(λ λc(z)))e R 2 (, z) = zλa 1r 2 ξ 2 (1 C(z))H2 (a 1(λ λc(z)e W(, z) = qλa 1 (1 r1 )ξ 1 H1 (a 1(λ λc(z))) + (1 r 2 )ξ 2 H2 (a 1(λ λc(z))) E where is given by the following relation = {(1 q) + qv (a 2 (λ λc(z)))}{(1 r 1 )ξ 1 H1 (a 1(λ λc(z))) + (1 r 2 )ξ 2 H2 (a 1(λ λc(z)))} (47) (48) (49) (5) (51) +(1 q) { r 1 ξ 1 (H 1 (a 1(λ λc(z))) 2 + r 2 ξ 2 (H 2 (a 2(λ λc(z))) 2} z Further we integrate Equations (27)-(31) w.r.t x an use Equation (2) to obtain P 1 (z) = zξ 11 H 1 (a 1(λ λc(z)))e (52) P 2 (z) = zξ 21 H 2 (a 1(λ λc(z)))e R 1 (z) = zr 1ξ 1 H 1 (a 1(λ λc(z))1 H 1 (a 1(λ λc(z))e R 2 (z) = zr 2ξ 2 H 2 (a 1(λ λc(z))1 H 2 (a 1(λ λc(z))e W(z) = q a 1 a 2 1 V (a 2 (λ λc(z))(1 r 1 )ξ 1 H1 (a 1(λ λc(z)) + (1 r 2 )ξ 2 H2 (a 1(λ λc(z))e (56) Let us now efine P Q (z) as the probability generating function of the queue size irrespective of the type of service the server is proviing, such that aing Equations (52)-(56) we get (53) (54) (55) P Q (z) = P 1 (z) + P 2 (z) + R 1 (z) + R 2 (z) + W(z) (57) 119
7 Journal of Mathematics Research Vol. 4, No. 4; 212 We etermine the unknown probability E by using the relation of the normalizing conition E + P 1 (1) + P 2 (1) + R 1 (1) + R 2 (1) + W(1) = 1 We now use L Hopital s Rule as the Equations (52)-(56) is ineterminate of the zero/zero form at z = 1 an simplifying we obtain P 1 (1) = lim P 1 ( z) z 1 ξ = 1 a 1 λ E(I)E(S 1 )E 1 a 1 λe(i){(1 r 1 )ξ 1 E(S 1 ) + (1 r 2 )ξ 2 E(S 2 )} + qa 2 λ E(I)E(V) {(1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } (58) 2(1 q) a 1 λ E(I){ r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E (S 2 )} P 2 (1) = lim P 2 (z) z 1 = = = = ξ 2 a 1 λ E(I) E(S 2 ) E 1 a 1 λe(i){(1 r 1 )ξ 1 E(S 1 ) + (1 r 2 )ξ 2 E(S 2 )} + qa 2 λ E(I) E(V) {(1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } 2(1 q) a 1 λ E(I) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 ) } R 1 (1) = lim z 1 R 1 (z) r 1 ξ 1 a 1 λ E(I) E(S 1 ) E 1 a 1 λe(i){(1 r 1 )ξ 1 E(S 1 ) + (1 r 2 )ξ 2 E(S 2 )} + qa 2 λ E(I) E(V) {(1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } 2(1 q) a 1 λ E(I) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 ) } R 2 (1) = lim z 1 R 2 (z) r 2 ξ 2 a 1 λ E(I) E(S 2 ) E 1 a 1 λe(i){(1 r 1 )ξ 1 E(S 1 ) + (1 r 2 )ξ 2 E(S 2 )} + qa 2 λ E(I)E(V) {(1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } 2(1 q) a 1 λ E(I) {r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 ) } W(1) = lim z 1 W(z) qa 1 λ E(I) E(V) { (1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 }E 1 a 1 λ E(I)(1 r 1 ) ξ 1 E(S 1 ) + (1 r 2 ) ξ 2 E(S 2 ) } + qa 2 λ E(I) E(V) { } (1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 2(1 q) a 1 λ E(I){ r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} where E(I) is the mean size of batch of arriving customers, E(S 1 ), E(S 2 ) are the mean service times of type 1 an type 2 server respectively, E(V) is the mean of vacation time an H () = 1, V () = 1. The RHS of the results (58)-(62) respectively give the steay state probability that the server is busy proviing type 1 service, type 2 services, repeating service of type 1, repeating type 2 service an server being on vacation. Now aing Equations (58)-(62) we get a1 λ E(I) { (1 + r 1 ) ξ 1 E(S 1 ) + (1 + r 2 ) ξ 2 E(S 2 )} + qa 1 λ E(I) E(V) { (1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } E P Q (1) = 1 a 1 λ E(I) {(1 r 1 ) ξ 1 E(S 1 ) + (1 r 2 ) ξ 2 E(S 2 ) } + qa 2 λ E(I) E(V) { } (1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 2(1 q) a 1 λ E(I){ r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} (63) which gives the steay state probability that the server is busy, irrespective of whether it is proviing type 1 or type 2 service an server being on vacation. Let us simplify the normalizing conition E + P Q (1) = 1 to get E an thus we have (59) (6) (61) (62) E = 1 a 1 λ E(I){ (1 r 1 ) ξ 1 E(S 1 ) + (1 r 2 ) ξ 2 E(S 2 ) } qa 2 λe(i) E(V) {(1 r 1 )ξ 1 + (1 r 2 ) ξ 2 } 2(1 q) a 1 λ E(I){r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} 1 + qa 1 λ E(I)E(V) {(1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } qa 2 λe(i)e(v) {(1 r 1 )ξ 1 + (1 r 2 ) ξ 2 } 2(1 q)a 1 λe(i){ r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 ) } (64) Also from (64) we obtain ρ as the utilization factor of the system as ρ = 1 E. 12
8 Journal of Mathematics Research Vol. 4, No. 4; 212 Now let P S (z) enote the probability generating function of the system size irrespective of the state of the system Thus P S (z) = P S (z) = P 1 (z) + P 2 (z) + R 1 (z) + R 2 (z) + W(z) + E {(1 q) + qv (a 2 (λ λc(z))+ q a 1 E a 2 1 V (a 2 (λ λc(z)) z}{(1 r 1 ) ξ 1 H1 (a 1(λ λc(z)) )+ (1 r 2 ) ξ 2 H2 (a 1(λ λc(z)) )}+{(1 q) z}{ r 1 ξ 1 (H1 (a 1(λ λc(z)) ) 2 + r 2 ξ 2 (H2 (a 1 (λ λc(z)) )2 } {(1 q) + qv (a 2 (λ λc(z))}{(1 r 1 ) ξ 1 H 1 (a 1(λ λc(z)) + (1 r 2 ) ξ 2 H 2 (a 1(λ λc(z))} + (1 q) { r 1 ξ 1 (H 1 (a 1(λ λc(z))) 2 + r 2 ξ 2 (H 2 (a 1(λ λc(z)) ) 2 } z 6. The Average Queue Size Let Lq enote the mean queue size at ranom epoch. Then L q = lim z 1 z P Q(z) Since this formula is also of zero/zero form, we use L Hopital s Rule twice an obtain D (z)n (z) N (z)d (z) L S = lim (66) z 1 2(D (z)) 2 where primes an ouble primes in (66) enote first an secon erivatives at z =1 respectively. N (1) = E a 1 λ E(I) { (1 + r 1 ) ξ 1 E(S 1 ) + (1 + r 2 ) ξ 2 E(S 2 )} qa 1 λe(i) E(V) {(1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } (65) 2 a 1 λ E(I){ ( 1 r 1 )ξ 1 E(S 1 ) + (1 r 2 ) ξ 2 E(S 2 ) } + a 1 λ E(I/I 1){ ξ 1 E(S 1 ) + ξ 2 E(S 2 )} ) + a 1 λ E(I) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 ) } + 2(a 1 λ E(I)) 2 { r 1 ξ 1 E(S 2 1 ) + r 2 ξ 2 E(S 2 2 ) } N (1) = E +(a 1 λ E(I/I 1) ) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 ) } (a 1 λ E(I)) 2 { r 1 ξ 1 ( E(S 1 )) 2 + r 2 ξ 2 ( E(S 2 )) 2 } +2q (a λ E(I)) 2 E(V) { (1 r 1 )ξ 1 E(S 1 ) + (1 r 2 ) ξ 2 E(S 2 )} +{ q ( a 1 λ E(I) ) 2 E(V 2 ) + a 1 λ E(I/I 1)E(V) } { (1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } D (1) = a 1 λ E(I) (1 r 1 ) ξ 1 E(S 1 ) + (1 r 2 ) ξ 2 E(S 2 ) + qa 2 λ E(I) E(V) { (1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } +2(1 q) a 1 λ E(I) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} 1 { (a 1 λ E(I)) 2 { (1 r 1 ) ξ 1 E(S 2 1 ) + (1 r 2) ξ 2 E(S 2 2 ) D (1) = a 1 λ E(I/I 1) } (1 r 1 ) ξ 1 E(S 1 ) + (1 r 2 ) ξ 2 E(S 2 ) } + a 1 a 2 ( λ E(I)) 2 { (1 r 1 ) ξ 1 E(S 1 ) + (1 r 2 ) ξ 2 E(S 2 )} + q ( a 2 λ E(I)) 2 E(V 2 ) { (1 r 1 ) ξ 1 + (1 r 2 ) ξ 2 } + 2(1 q) (a 1 λ E(I)) 2 { r 1 ξ 1 E(S 2 1 ) + r 2 ξ 2 E(S 2 2 ) +a 1 λ E(I/I 1){ r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} + (a 1 λ E(I)) 2 { r 1 ξ 1 (E(S 1 )) 2 + r 2 ξ 2 (E(S 2 )) 2 } where E(S 1 2), E(S 2 2), E(V2 ) are the secon moments of service times of type 1, type 2 an vacation time respectively. E(I/I 1) is the secon factorial moment of the batch of arriving customers, H1 () = 1, H 2 () = 1, V () = 1 an E has been obtaine in (64). We can also obtain L = L q + ρ by using the above relations, which gives the steay-state average size of the queue system. 121
9 Journal of Mathematics Research Vol. 4, No. 4; Particular Cases Case 1. Re-service in a Vacation queue with Batch arrival an Two types of General Heterogeneous Service. Here we consier the situation when there is no balking i.e. all customers join the system, an in that case, we take a 1 = a 2 = 1; thus Equation (65) becomes P S (z) = E (1 z ) { (1 r 1 ) ξ 1 H1 (λ λ C(z))+ (1 r 2 ) ξ 2 H2 (λ λ C(z))} +{ (1 q) z} {r 1 ξ 1 (H1 (λ λ C(z)))2 + r 2 ξ 2 ( H2 (λ λ C(z)))2 } { (1 q) + qv (λ λ C(z))}{(1 r 1 ) ξ 1 H1 (λ λ C(z)) + (1 r 2) ξ 2 H2 (λ λ C(z)) } + (1 q) { r 1 ξ 1 ( H1 (λ λc(z)))2 + r 2 ξ 2 ( H2 (λ λ C(z)) )2 } is the queue size istribution of a batch arrival queuing system with two types of general heterogeneous service with vacation an optional re-service where ile time E E = 1 λ E(I) { ξ 1 E(S 1 ) + ξ 2 E(S 2 )} λ E(I) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} qλ E(I) E(V) {(1 r 1 )ξ 1 + (1 r 2 ) ξ 2 } + 2q λ E(I) {r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} 1 2(1 q) λ E(I) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} Case 2. Balking an Re-service with Batch arrival with an two types of general Heterogeneous Service. Here we assume that the server oes not take vacation, i.e. q = ; an obtain { (1 r1 ) ξ 1 H1 (a 1(λ λc(z)) ) + (1 r 2 ) ξ 2 H2 (a 1(λ λc(z)) ) } E (1 z) + { r 1 ξ 1 ( H1 P S (z) = (a 1(λ λc(z)) ) 2 + r 2 ξ 2 ( H2 (a 1(λ λc(z)) ) 2} { (1 r1 ) ξ 1 H1 (a 1(λ λc(z)) ) + (1 r 2 ) ξ 2 H2 (a 1(λ λc(z)) ) } + { r 1 ξ 1 ( H 1 (a 1(λ λc(z)) ) 2 + r 2 ξ 2 (H 2 (a 1(λ λc(z)) ) 2} z is the queue size istribution of Batch arrival queuing system with two types of general heterogeneous service with balking an optional re-service an E = 1 a 1 λ E(I) { ξ 1 E(S 1 ) + ξ 2 E(S 2 )} a 1 λ E(I) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 ) } 1 2a 1 λ E(I) { r 1 ξ 1 E(S 1 ) + r 2 ξ 2 E(S 2 )} Case 3. Balking in a Vacation queue with batch arrival an two types of Heterogeneous service. Here we assume that there is no re-service, then r 1 = r 2 =, our queue size istribution reuces to P S (z) = E { (1 q) + qv (a 2 (λ λc(z)) ) + q a 1 a 2 1 V (a 2 (λ λc(z))) z }{ ξ 1 H 1 (a 1(λ λc(z)) ) + ξ 2 H 2 (a 1(λ λc(z)) ) } {(1 q) + qv (a 2 (λ λc(z)))}{ξ 1 H 1 (a 1(λ λc(z)) ) + ξ 2 H 2 (a 1(λ λc(z)) ) } z (69) E = 1 a 1 λ E(I) {ξ 1 E(S 1 ) + ξ 2 E(S 2 ) } qa 2 λ E(I) E(V). 1 + qa 1 λ E(I) E(V) qa 2 λ E(I) E(V) Case 4. If we assume that there is two types of heterogeneous service, optional re-service, no vacation, no balking, then q = ; a 1 = a 2 = 1, the PGF in (65) reuces to {1 z}{(1 r1 )ξ E 1 H1 (λ λc(z)) + (1 r 2)ξ 2 H2 (λ λc(z))} +(1 z){r 1 ξ 1 (H1 P S (z) = (λ λc(z)))2 + r 2 ξ 2 (H2 (λ λc(z)) )2 } {(1 r1 )ξ 1 H1 (λ λc(z))+ (1 r (7) 2)ξ 2 H2 (λ λc(z))} {r 1 ξ 1 (H1 (λ λc(z)) )2 + r 2 ξ 2 (H2 (λ λc(z)) z )2 E = 1 λ E(I) {(1 + r 1 )ξ 1 E(S 1 ) + (1 + r 2 )ξ 2 E(S 2 ))} ( ) Which tallies with the result obtaine by Maan et al. (24) for a M X G1 / 1 queue with optional re-service. G 2 Case 5. Again if we consier the situation when there is no case of optional re-service an no balking (i.e. all arriving batches join the system) with two types of heterogeneous service an vacation then, r 1 = r 2 = ; a 1 = a 2 = 1, then (65) becomes (67) (68) P S (z) = E (1 z){ξ 1 H1 (λ λc(z)) + ξ 2H2 (λ λc(z))} {(1 q) + qv (λ λc(z)}{ξ 1 H1 (λ λc(z) + ξ 2H2 (λ λc(z)} z (71) 122
10 Journal of Mathematics Research Vol. 4, No. 4; 212 E = 1 λe(i) { ξ 1 E(S 1 ) + ξ 2 E(S 2 )} q λ E(I) E(V) Thus our result (71) is equivalent to( the result ) obtaine by Maan et al. (25) for the PGF of a queue size istribution at ranom epoch of M X G1 / /1/G(BS )/V G S with batch arrivals, two kins of general heterogeneous 2 service an general vacation time with Bernoulli Scheules. Case 6. Now further we assume that in aition to the particular cases in (5), if we take ξ 2 = ; i.e. ξ 1 = 1, which means the server is proviing only one type of service an without re-service an balking, we obtain P S (z) = E(1 z)h1 (λ λc(z)) { (1 q) + qv (λ λ C(z))} H1 (λ λ C(z)) z (72) E = 1 λe(i) ξ 1 E(S 1 ) q λ E(I) E(V) Thus the result (72) reuces to the probability generating function (PGF) of a queue size istribution at a ranom epoch for M X /G/1/G(BS )/V S queue with batch arrivals, general service an general vacation first stuie by Maan (24) who consiere first service general an secon service exponential. Case 7. Now if we consier a system with two types of general heterogeneous service but no optional re-service, no vacation an no balking, i.e. r 1 = r 2 =, q =, a 1 = a 2 = 1, then we obtain the queue size P S (z) = E(1 z){ξ 1H1 (λ λc(z)) + ξ 2H2 (λ λc(z))} {ξ 1 H1 (λ λc(z) + ξ 2H2 (λ λc(z))} z (73) E = 1 λe(i)ξ 1 E(S 1 ) λe(i)ξ 2 E(S 2 ) Case 8. Again in aition to particular cases in (73), if we assume that there is only one type of service then P S (z) = E(1 z)h 1 (λ λc(z)) H1 (λ λc(z)) z (74) E = 1 λe(i) ξ 1 E(S 1 ) is the queue size istribution of a M X /G/1 batch arrival proviing single service follows the result obtaine by Gaver (1959). References Baba, Y. (1986). On the M X /G/1 queue with vacation time. Operation Research Letters, 5, Borthakur, A., & Chouhury, G. (1997). On a batch arrival queue with generalize Vacation. Sankhya-Series B, 59, Chouhury, G. (22). Analysis of the M X /G/1 queuing system with vacation times. Sankhya-Series B, 64(1), Chouhury, G., & Maan, K. C. (27). A batch arrival Bernoulli vacation queue with ranom set up time uner restricte amissibility policy. International Journal of Operation Research (USA), 2(1), Doshi, B. T. (1986). Queuing Systems with Vacation - a survey. Queuing Systems 1, Gaver, D. P. (1959). Imbee markov chain analysis of a waiting line process in continuous time. Ann. Mathematical Statistics, 3, Glenbe, G., & Pujolle, G. (1987). Introuction to Queueing Networks. New York: John Wiley an Sons. Lee, H. W., & Lee, S. S. (1993). Correcte istribution of ile perio in M/G/1 queue with multiple vacations. Research Report, Department of Inustrial Engineering, Sung Kyon University, Suwon, Korea. Jeyakumar, S., & Arumuganathan. (211). A Non-Markovian Queue with Multiple Vacations an Control Policy on Request for Re-service. Quality Technology of Quantitative Management (QTQM), 8(3),
11 Journal of Mathematics Research Vol. 4, No. 4; 212 Maan, K. C. (1988). A cyclic queuing system with three servers an optional two-way feeback. Microelectron Rel., 28(6), Maan, K. C. (2). An M/G/1 queue with secon optional service. Queuing Systems Theory Appl., 34, 1-4, Maan, K. C., & Abu-Dayyeh, W. (22). Restricte amissibility of batches into an M/G/1 type bulk queue with moifie Bernoulli scheule server vacations. ESAIM Probability Statistics, 6, Maan, K. C., & Chouhury, G. (24). Steay state analysis of an M X /(G 1 G 2 )/1 queue with restricte amissibility an moifie Bernoulli scheule server vacation. Journal of Probability an Statistical Science, 2(2), Maan, K. C., Al-Rawi, Z. R., & Al-Nasser, A. D. (25). On a M X /G 1 G 2 )/1/G(BS )/V s vacation queue with two types of general heterogeneous service. Journal of Applie Mathematics an Decision Sciences, 3, Takagi, H. (199). Time-epenent analysis of an M/G/1 vacation moels with exhaustive service. Queueuing Systems, 6(1),
An M/G/1 Retrial Queue with Priority, Balking and Feedback Customers
Journal of Convergence Information Technology Volume 5 Number April 1 An M/G/1 Retrial Queue with Priority Balking an Feeback Customers Peishu Chen * 1 Yiuan Zhu 1 * 1 Faculty of Science Jiangsu University
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 informationSingle Server Retrial Bulk Queue With Two Phases Of Essential Server And Vacation Policy
Single Server Retrial Bul Queue With Two Phases Of Essential Server An Vacation Policy Dr. S.Anan Gnana Selvam, 2 Dr.. Reni Sagayara, 3 S. Janci Rani Department of athematics, A.E.T Arts an Science College,
More informationAN M/M/1 QUEUEING SYSTEM WITH INTERRUPTED ARRIVAL STREAM K.C. Madan, Department of Statistics, College of Science, Yarmouk University, Irbid, Jordan
REVISTA INVESTIGACION OPERACIONAL Vol., No., AN M/M/ QUEUEING SYSTEM WITH INTERRUPTED ARRIVAL STREAM K.C. Maan, Department of Statistics, College of Science, Yarmouk University, Irbi, Joran ABSTRACT We
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 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 informationA New Measure for M/M/1 Queueing System with Non Preemptive Service Priorities
International Journal of IT, Engineering an Applie Sciences Research (IJIEASR) ISSN: 239-443 Volume, No., October 202 36 A New Measure for M/M/ Queueing System with Non Preemptive Service Priorities Inu
More informationEquilibrium in Queues Under Unknown Service Times and Service Value
University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University
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 informationFluid Models with Jumps
Flui Moels with Jumps Elena I. Tzenova, Ivo J.B.F. Aan, Viyahar G. Kulkarni August 2, 2004 Abstract In this paper we stuy a general stochastic flui moel with a single infinite capacity buffer, where the
More informationPriority Queueing System with a Single Server Serving Two Queues M [X 1], M [X 2] /G 1, G 2 /1 with Balking and Optional Server Vacation
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 11, Issue 1 (June 216), pp. 61 82 Applications and Applied Mathematics: An International Journal (AAM) Priority Queueing System
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
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 informationM [X] /G/1 with Second Optional Service, Multiple Vacation, Breakdown and Repair
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 3-9364, ISSN (Print): 3-9356 Volume Issue ǁ November. 4 ǁ PP.7-77 M [X] /G/ with Second Optional Service, Multiple Vacation,
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 informationBatch Arrival Queueing System. with Two Stages of Service
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 6, 247-258 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.411 Batch Arrival Queueing System with Two Stages of Service S. Maragathasundari
More informationLaplace s Equation in Cylindrical Coordinates and Bessel s Equation (II)
Laplace s Equation in Cylinrical Coorinates an Bessel s Equation (II Qualitative properties of Bessel functions of first an secon kin In the last lecture we foun the expression for the general solution
More informationMarkovian N-Server Queues (Birth & Death Models)
Markovian -Server Queues (Birth & Death Moels) - Busy Perio Arrivals Poisson (λ) ; Services exp(µ) (E(S) = /µ) Servers statistically ientical, serving FCFS. Offere loa R = λ E(S) = λ/µ Erlangs Q(t) = number
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationA Tandem Queueing model for an appointment-based service system
Queueing Syst (2015) 79:53 85 DOI 10.1007/s11134-014-9427-5 A Tanem Queueing moel for an appointment-base service system Jianzhe Luo Viyahar G. Kulkarni Serhan Ziya Receive: 3 April 2013 / Revise: 9 October
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
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 informationA Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size
A Better Moel for Job Reunancy: Decoupling Server Slowown an Job Size Kristen Garner 1 Mor Harchol-Balter 1 Alan Scheller-Wolf Benny Van Hout 3 October 1 CMU-CS-1-131 School of Computer Science Carnegie
More informationExponential asymptotic property of a parallel repairable system with warm standby under common-cause failure
J. Math. Anal. Appl. 341 (28) 457 466 www.elsevier.com/locate/jmaa Exponential asymptotic property of a parallel repairable system with warm stanby uner common-cause failure Zifei Shen, Xiaoxiao Hu, Weifeng
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationMath 597/697: Solution 5
Math 597/697: Solution 5 The transition between the the ifferent states is governe by the transition matrix 0 6 3 6 0 2 2 P = 4 0 5, () 5 4 0 an v 0 = /4, v = 5, v 2 = /3, v 3 = /5 Hence the generator
More informationSingle Server Bulk Queueing System with Three Stage Heterogeneous Service, Compulsory Vacation and Balking
International Journal of Scientific and Research Publications, Volume 7, Issue 4, April 217 3 ISSN 225-3153 Single Server Bulk Queueing System with Three Stage Heterogeneous Service, Compulsory Vacation
More informationIPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy
IPA Derivatives for Make-to-Stock Prouction-Inventory Systems With Backorers Uner the (Rr) Policy Yihong Fan a Benamin Melame b Yao Zhao c Yorai Wari Abstract This paper aresses Infinitesimal Perturbation
More informationNumerical Key Results for Studying the Performance of TCP Traffic under Class-Based Weighted Fair Queuing System
Journal of ommunication an omputer 13 (2016) 195-201 oi:10.17265/1548-7709/2016.04.007 D DAVID PUBLISHING Numerical Key Results for Stuying the Performance of TP Traffic uner lass-base Weighte Fair Queuing
More informationBlended Call Center with Idling Times during the Call Service
Blene Call Center with Iling Times uring the Call Service Benjamin Legros a Ouali Jouini b Ger Koole c a EM Normanie, Laboratoire Métis, 64 Rue u Ranelagh, 7506, Paris, France b CentraleSupélec, Université
More informationImproving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers
International Journal of Statistics an Probability; Vol 6, No 5; September 207 ISSN 927-7032 E-ISSN 927-7040 Publishe by Canaian Center of Science an Eucation Improving Estimation Accuracy in Nonranomize
More informationResearch Article When Inflation Causes No Increase in Claim Amounts
Probability an Statistics Volume 2009, Article ID 943926, 10 pages oi:10.1155/2009/943926 Research Article When Inflation Causes No Increase in Claim Amounts Vytaras Brazauskas, 1 Bruce L. Jones, 2 an
More information12.11 Laplace s Equation in Cylindrical and
SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering
More informationStudents need encouragement. So if a student gets an answer right, tell them it was a lucky guess. That way, they develop a good, lucky feeling.
Chapter 8 Analytic Functions Stuents nee encouragement. So if a stuent gets an answer right, tell them it was a lucky guess. That way, they evelop a goo, lucky feeling. 1 8.1 Complex Derivatives -Jack
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationA Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size
A Better Moel for Job Reunancy: Decoupling Server Slowown an Job Size Kristen Garner, Mor Harchol-Balter, Alan Scheller-Wolf, an Benny Van Hout 1 Abstract Recent computer systems research has propose using
More informationClosed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device
Close an Open Loop Optimal Control of Buffer an Energy of a Wireless Device V. S. Borkar School of Technology an Computer Science TIFR, umbai, Inia. borkar@tifr.res.in A. A. Kherani B. J. Prabhu INRIA
More informationLecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations
Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationLie symmetry and Mei conservation law of continuum system
Chin. Phys. B Vol. 20, No. 2 20 020 Lie symmetry an Mei conservation law of continuum system Shi Shen-Yang an Fu Jing-Li Department of Physics, Zhejiang Sci-Tech University, Hangzhou 3008, China Receive
More informationPredictive control of synchronous generator: a multiciterial optimization approach
Preictive control of synchronous generator: a multiciterial optimization approach Marián Mrosko, Eva Miklovičová, Ján Murgaš Abstract The paper eals with the preictive control esign for nonlinear systems.
More informationensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y
Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay
More informationAnalysis of tandem fluid queues
Analysis of tanem flui queues Małgorzata M. O Reilly School of Mathematics University of Tasmania Tas 7001, Australia malgorzata.oreilly@utas.eu.au Werner Scheinhart Department of Applie Mathematics University
More informationSection 2.7 Derivatives of powers of functions
Section 2.7 Derivatives of powers of functions (3/19/08) Overview: In this section we iscuss the Chain Rule formula for the erivatives of composite functions that are forme by taking powers of other functions.
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationState-Space Model for a Multi-Machine System
State-Space Moel for a Multi-Machine System These notes parallel section.4 in the text. We are ealing with classically moele machines (IEEE Type.), constant impeance loas, an a network reuce to its internal
More informationThermal conductivity of graded composites: Numerical simulations and an effective medium approximation
JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University
More informationFUNDAMENTALS OF STOCHASTIC NETWORKS
FUNDAMENTALS OF STOCHASTIC NETWORKS FUNDAMENTALS OF STOCHASTIC NETWORKS OLIVER C. IBE University of Massachusetts Lowell Massachusetts A JOHN WILEY & SONS INC. PUBLICATION Copyright 11 by John Wiley &
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationImproved Rate-Based Pull and Push Strategies in Large Distributed Networks
Improve Rate-Base Pull an Push Strategies in Large Distribute Networks Wouter Minnebo an Benny Van Hout Department of Mathematics an Computer Science University of Antwerp - imins Mielheimlaan, B-00 Antwerp,
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationBEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS. Mauro Boccadoro Magnus Egerstedt Paolo Valigi Yorai Wardi
BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS Mauro Boccaoro Magnus Egerstet Paolo Valigi Yorai Wari {boccaoro,valigi}@iei.unipg.it Dipartimento i Ingegneria Elettronica
More informationPower Generation and Distribution via Distributed Coordination Control
Power Generation an Distribution via Distribute Coorination Control Byeong-Yeon Kim, Kwang-Kyo Oh, an Hyo-Sung Ahn arxiv:407.4870v [math.oc] 8 Jul 204 Abstract This paper presents power coorination, power
More informationarxiv: v4 [math.pr] 27 Jul 2016
The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,
More informationMarkov Chains in Continuous Time
Chapter 23 Markov Chains in Continuous Time Previously we looke at Markov chains, where the transitions betweenstatesoccurreatspecifietime- steps. That it, we mae time (a continuous variable) avance in
More informationarxiv: v1 [physics.flu-dyn] 8 May 2014
Energetics of a flui uner the Boussinesq approximation arxiv:1405.1921v1 [physics.flu-yn] 8 May 2014 Kiyoshi Maruyama Department of Earth an Ocean Sciences, National Defense Acaemy, Yokosuka, Kanagawa
More informationOPTIMAL CONTROL PROBLEM FOR PROCESSES REPRESENTED BY STOCHASTIC SEQUENTIAL MACHINE
OPTIMA CONTRO PROBEM FOR PROCESSES REPRESENTED BY STOCHASTIC SEQUENTIA MACHINE Yaup H. HACI an Muhammet CANDAN Department of Mathematics, Canaale Onseiz Mart University, Canaale, Turey ABSTRACT In this
More informationOn Characterizing the Delay-Performance of Wireless Scheduling Algorithms
On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,
More informationA note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz
A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae
More informationA Batch Arrival Retrial Queue with Two Phases of Service, Feedback and K Optional Vacations
Applied Mathematical Sciences, Vol. 6, 212, no. 22, 171-187 A Batch Arrival Retrial Queue with Two Phases of Service, Feedback and K Optional Vacations D. Arivudainambi and P. Godhandaraman Department
More information1. Aufgabenblatt zur Vorlesung Probability Theory
24.10.17 1. Aufgabenblatt zur Vorlesung By (Ω, A, P ) we always enote the unerlying probability space, unless state otherwise. 1. Let r > 0, an efine f(x) = 1 [0, [ (x) exp( r x), x R. a) Show that p f
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationGeneralization of the persistent random walk to dimensions greater than 1
PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,
More informationarxiv: v2 [cond-mat.stat-mech] 11 Nov 2016
Noname manuscript No. (will be inserte by the eitor) Scaling properties of the number of ranom sequential asorption iterations neee to generate saturate ranom packing arxiv:607.06668v2 [con-mat.stat-mech]
More informationarxiv:hep-th/ v1 3 Feb 1993
NBI-HE-9-89 PAR LPTHE 9-49 FTUAM 9-44 November 99 Matrix moel calculations beyon the spherical limit arxiv:hep-th/93004v 3 Feb 993 J. Ambjørn The Niels Bohr Institute Blegamsvej 7, DK-00 Copenhagen Ø,
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 informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationTRACKING CONTROL OF MULTIPLE MOBILE ROBOTS: A CASE STUDY OF INTER-ROBOT COLLISION-FREE PROBLEM
265 Asian Journal of Control, Vol. 4, No. 3, pp. 265-273, September 22 TRACKING CONTROL OF MULTIPLE MOBILE ROBOTS: A CASE STUDY OF INTER-ROBOT COLLISION-FREE PROBLEM Jurachart Jongusuk an Tsutomu Mita
More informationSituation awareness of power system based on static voltage security region
The 6th International Conference on Renewable Power Generation (RPG) 19 20 October 2017 Situation awareness of power system base on static voltage security region Fei Xiao, Zi-Qing Jiang, Qian Ai, Ran
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 informationA Modification of the Jarque-Bera Test. for Normality
Int. J. Contemp. Math. Sciences, Vol. 8, 01, no. 17, 84-85 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1988/ijcms.01.9106 A Moification of the Jarque-Bera Test for Normality Moawa El-Fallah Ab El-Salam
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
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 informationLogarithmic spurious regressions
Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate
More informationRole of parameters in the stochastic dynamics of a stick-slip oscillator
Proceeing Series of the Brazilian Society of Applie an Computational Mathematics, v. 6, n. 1, 218. Trabalho apresentao no XXXVII CNMAC, S.J. os Campos - SP, 217. Proceeing Series of the Brazilian Society
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More informationA Fair Comparison of Pull and Push Strategies in Large Distributed Networks
1 A Fair Comparison of Pull an Push Strategies in Large Distribute Networks Wouter Minnebo an Benny Van Hout, Member, IEEE Abstract In this paper we compare the performance of the pull an push strategy
More informationScott E. Grasman 1, Zaki Sari 2 and Tewfik Sari 3
RAIRO Operations Research RAIRO Oper. Res. 41 (27) 455 464 DOI: 1.151/ro:2731 NEWSVENDOR SOLUTIONS WITH GENERAL RANDOM YIELD DISTRIBUTIONS Scott E. Grasman 1, Zaki Sari 2 an Tewfik Sari 3 Abstract. Most
More informationOnline Appendix for Trade Policy under Monopolistic Competition with Firm Selection
Online Appenix for Trae Policy uner Monopolistic Competition with Firm Selection Kyle Bagwell Stanfor University an NBER Seung Hoon Lee Georgia Institute of Technology September 6, 2018 In this Online
More informationSummary: Differentiation
Techniques of Differentiation. Inverse Trigonometric functions The basic formulas (available in MF5 are: Summary: Differentiation ( sin ( cos The basic formula can be generalize as follows: Note: ( sin
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationAnalysis 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 informationDesigning of Acceptance Double Sampling Plan for Life Test Based on Percentiles of Exponentiated Rayleigh Distribution
International Journal of Statistics an Systems ISSN 973-675 Volume, Number 3 (7), pp. 475-484 Research Inia Publications http://www.ripublication.com Designing of Acceptance Double Sampling Plan for Life
More informationOptimal Strategy Analysis of an N-policy Twophase. Server Startup and Breakdowns
Int. J. Open Problems Compt. Math., Vol. 3, No. 4, December 200 ISSN 998-6262; Copyright ICSRS Publication, 200 www.i-csrs.org Optimal Strategy Analysis of an N-policy Twophase M X /M/ Gated Queueing System
More informationThis module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics
This moule is part of the Memobust Hanbook on Methoology of Moern Business Statistics 26 March 2014 Metho: Balance Sampling for Multi-Way Stratification Contents General section... 3 1. Summary... 3 2.
More informationUnit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule
Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin
More informationθ x = f ( x,t) could be written as
9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)
More informationA Review of Multiple Try MCMC algorithms for Signal Processing
A Review of Multiple Try MCMC algorithms for Signal Processing Luca Martino Image Processing Lab., Universitat e València (Spain) Universia Carlos III e Mari, Leganes (Spain) Abstract Many applications
More informationINFLUENCE OF SURFACE ROUGHNESS THROUGH A SERIES OF FLOW FACTORS ON THE PERFORMANCE OF A LONGITUDINALLY ROUGH FINITE SLIDER BEARING
ANNALS of Faculty Engineering Huneoara International Journal of Engineering Tome XIV [2016] Fascicule 2 [May] ISSN: 1584-2665 [print; online] ISSN: 1584-2673 [CD-Rom; online] a free-accessmultiisciplinarypublication
More informationThroughput Optimal Control of Cooperative Relay Networks
hroughput Optimal Control of Cooperative Relay Networks Emun Yeh Dept. of Electrical Engineering Yale University New Haven, C 06520, USA E-mail: emun.yeh@yale.eu Ranall Berry Dept. of Electrical an Computer
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 informationIPMSM Inductances Calculation Using FEA
X International Symposium on Inustrial Electronics INDEL 24, Banja Luka, November 68, 24 IPMSM Inuctances Calculation Using FEA Dejan G. Jerkan, Marko A. Gecić an Darko P. Marčetić Department for Power,
More informationThe Principle of Least Action
Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of
More informationQuantile function expansion using regularly varying functions
Quantile function expansion using regularly varying functions arxiv:705.09494v [math.st] 9 Aug 07 Thomas Fung a, an Eugene Seneta b a Department of Statistics, Macquarie University, NSW 09, Australia b
More informationTAYLOR S POLYNOMIAL APPROXIMATION FOR FUNCTIONS
MISN-0-4 TAYLOR S POLYNOMIAL APPROXIMATION FOR FUNCTIONS f(x ± ) = f(x) ± f ' (x) + f '' (x) 2 ±... 1! 2! = 1.000 ± 0.100 + 0.005 ±... TAYLOR S POLYNOMIAL APPROXIMATION FOR FUNCTIONS by Peter Signell 1.
More information1 Math 285 Homework Problem List for S2016
1 Math 85 Homework Problem List for S016 Note: solutions to Lawler Problems will appear after all of the Lecture Note Solutions. 1.1 Homework 1. Due Friay, April 8, 016 Look at from lecture note exercises:
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More information