Microelectron. Reliab., Vol. 31, No. 2/3, pp. 257-259, 1991. Printed in Great Britain.

0026-2714/9153.00 + .00 1991 Pergamon Press plc

THREE-SERVER BULK SERVICE QUEUE SERVICE INTERRUPTIONS A N D EXPONENTIAL REPAIRS

WITH

I. P. SINGH a n d CHHOTU RAM Mechanical Engineering Department, Regional Engineering College, Kurukshetra-132119 (Haryana), India

(Received for publication 22 May 1990)

Abstract--A system which serves batches of fixed size by three identical channels is considered. The service channels are subjected to random breakdown. The various transition probabilities are obtained by Laplace transforms and generating functions techniques.

1. INTRODUCTION In this model, we discuss a queue system with three identical service c h a n n e l s with exponential arrival a n d b u l k service to arriving units. W h e n the units do n o t o b t a i n service at the i n s t a n t o f their arrival, they have to wait a n d a queue is formed. All three service c h a n n e l s are subjected to occasional r a n d o m failure. T h e example o f this type is the m a n u f a c t u r i n g o f R.C.C. pipes in batches of fixed size o n the m a c h i n e in a spun pipe factory for loading o f pipes in trucks by the loader. The i n c o m i n g units are serviced in batches of fixed size b. The next b a t c h o f size b or the whole queue, whichever is smaller, is t a k e n by the service c h a n n e l when it becomes free, after completing the servicing o f a batch. However, if, at any time, there is n o unit in the queue a n d the c h a n n e l has completed the service, then the service c h a n n e l will r e m a i n idle, until the new arrival of a unit. A t any time, if there is n o unit waiting for service a n d all three c h a n n e l s have completed the service, then the incoming units in the queue m a y be t a k e n by any o f the channels, with equal p r o b a b i l i t y (1/3). 2. DESCRIPTION OF THE SYSTEM The system is described as follows: (I) The basis of service is 'first come first served'. (2) The units arrive in Poisson stream, i.e. one by one, with mean arrival rate ct(ct > 0), and form a queue. (3) The service time for each channel is distributed exponentially, with mean service time l/p [(8 > 0). (4) The operative time and repair time of all three service channels are also distributed exponentially, with mean operative time I/E and mean repair time 1/0 (E, 0 > 0). (5) It is also assumed that all the service channels can be repaired simultaneously. (6) As soon as a channel fails, it is immediately sent for repair and the units partially served will remain with it during its repair; after repair, the service of the paritally served units will be completed.

(7) In the case where a service channel has no unit while it is being repaired (this may happen when it fails in an idle state), it has been assumed that immediately after repair the service channel will serve a batch of zero unit. 3. STATE OF SERVICE CHANNELS All three service channels are busy (working). Two service channels are busy and one is under repair. Two service channels are busy and one is idle. Two service channels are busy and two are under repair. One service channel is busy and two are idle. All three service channels are under repair. One service channel is busy, one is idle and one is under repair. (8) All three service channels are idle. (9) One service channel is idle and two are under repair. (10) Two service channels are idle and one is under repair. 4. DEFINITIONS AND NOTATIONS probability that, at time t, n units are waiting for service, i.e. the length of the queue is n(>/0) (excluding those in service) and all three service channels are busy e~j(t) probability that, at time t, the length of the queue is n(/> 0) and the channels j ( / = I, 2, 3) are under repair; when j = 1, 2 the other channels are busy Qi(t) probability that the length of the queue is zero and i (i = 1, 2, 3) channels are idle; when i = 1, 2 the other channels are busy; when i = 3, all channels are idle s,(t) probability that, at time t, the length of the queue is zero and i (i = 1, 2) channels are idle and others are under repair x ( t ) probability that, at time t, the length of the queue is zero and one service channel is busy, one is under repair and one is idle ct, fl, o, e mean arrival, service, repair and operative rates, respectively e~(t) 5. INITIAL CONDITION F o r the initial c o n d i t i o n we reckon time f r o m the i n s t a n t w h e n there is no unit in the queue a n d all 257 (1) (2) (3) (4) (5) (6) (7)

258

1. P. SINGH and CHHOTU RAM

three service channels are idle (though in working condition), so that

Q3(0) = 1. 6. F O R M A T I O N OF E Q U A T I O N S AND THEIR SOLUTION

(s + a + 30)P,S,,3(s) = aP~_ l),~(s) + ~P~,(s) (s + ~ + 30)P~.3(s) = ~[P~z(s) + g2(s)]

(7) (8)

(s + a + 2/3 + 3~)Q~ (s) = aQ~(s) + 3/3py(s) + O(s) (9) (s + a +/3 + 3)Qds) = aQ3(s) + 2/3Q1 (s) + og~_(s) (10)
(S -b Ct -b 3E)~)3(S ) = 1 -k-/3~)2(S) (11)

The Laplace transforms [1] of differential equations which are associated with the system are (using the above initial equation) (s + ~ + 3/3 + 3OpW(s)
= O~Pn W I ( S ) -b

(s + a + e + 2 0 ) ~ ( s ) = 20~2(s ) + )7(s) (s + ~ +2E + O ) ~ ( s ) = / 3 X ( s )

(12) (13)

3/3pw+~(s) + OP~(s)
b

(1)

(s + ~ + 2~ + o ) ( s ) = 2/3P~(s)

(s + ~ + 3/3 + 3QP~V(s) = ~Ql(s) + 3/3 ~ P~V(s) + 0Pgl(s)

k=l

+ a~2(s) + 2~Q~(s) + 20g~(s). (2)

(14)

We now define the following probability generating functions [2]:

(s + a + 2/3 + 2E + 0)P~t(S) = aP~._ ~),~(s) + 2/3P~.+b),l(s) + 3gP.W(s) + 20P~E(S) (s + a + 2/3 + 2e + 0)P~,I (s) = aX(s)
b

(3)

W(s,x)= ~ x"pW(s)
n~O

(15)

R~(s. x) = ~ x"P.~j(s);
n=0

(j = 1, 2, 3).

(16)

+ 2/3 ~ Pk,I(S) + 3eP0W(S) + 20P~,z(S)

k=l

(4)

Now, multiplying equations (1)-(8) by a suitable power of x and adding all over n and using equations (15) and (16), we have

b-1

3/3 ~ (x b - xk)PW(s) + xb[O~l (s, x) + ~(~1(s) - 3/3p~V(s)]

W(s, x) b 1 k=O

Is + ~(1 - x) + 3/3 + 3E]x b - 3/3

(17)

2/3 ~ (x b - xk)Pf.l(S) + Xb[3EW(s, X) + 20R:(s, x) + X(s) - 2/3Pgl(s)]

R 1(s, x ) =
b k=0
k=O

[s + ~(1 - x) + 213 -b 2~ + O]x b - 2/3

1

(18)

/3 ~ (x b -- xk)P~2 (s) + xb[2ORl (s, x) + 30R3(s. x) -b ~g, (s) -/3P~,z(S)]

R~(s, x ) =

[s -b ~(1 - x ) - b / 3 -be -b 20]x b - / 3

R3(s, x) =

(19) (20)

E[R2(s, x) + ~z(S)]
s + ct(1 - ct) + 30 '

Solving equations (17)-(20) simultaneously and simplifying we have

W(s, x ) =

(D3D 4 - 30Exb)(hlD2 -b h20x b) - 40tx~hl + 202x~hsD4 + 606xSbS2(s ) (DI D2 - 30EX 2b) (D3 D4 - 30Ex b) - 40eDl D4x 2b
(D3D 4 --

(21)

RI (s, x)

30Exb)(3hl Ex b + h2Dl) + 2h3Dl D40x b + 602EX2b~2(S ) (DI D2 - - 3 0 E x 2b) (D3 D4 - 30Ex b) -- 40EDI D4x ~ where

(22)

(s + ~ +/3 + E + 2 0 ) P ~ d s ) = ~P~._ , , d s )

D 1 = {s + e(1 -- x) + 3/3 + 3E}x b - 3// (5) O2= {s + ot(l _ x) + 2/3 + 2e + O}xO_ 2/3
D 3 = { S -b 0c(1 -- x ) - b fl -bE -b 2 0 } x - / 3

+/3P~. +1).2(s) + 2EP~I (s) + 30P~3 (s) (s + ~ +/3 + E + 20)Pg.2(s)= egl(s)

b

+/3 ~ P~.2(s) + 2EP~I (s) + 30Pg,3(s)

k=l

(6)
D , = {s + ~ ( 1 - x ) +

30}

Three-server bulk service queue

b-I

259

hi = 38 ~ (x b - xk)pW(s)
k=0

and
f(x) =
on {O 102 --

3 0 , x 2 b } { O 3 0 4 - 30,xb};

+ {~0-i (s) -- 3 8 P ~ ( s ) } x b
b-I

Ixl = 1
If(x)[ = [[O, liD= I - 30,lx~tl[lo3[ Io, I - 30, Ix~l].
On solving on

h z = 2 8 ~ (x - xk)P~.l (s)
k=0

+ {~)?(s ) - 28P~, (sl}x ~

b-I

Ix I= 1 If(x)l
= 3602,2=

Ig(x)l.

h3 = 8 Y~ ( x~ -- x k ) p f A s)
k=O

+ {~,~l (~) - 8Po",~(~)}x~.

To determine the u n k n o w n s we apply Rouche's theorem to the denominator in the right-hand side of equation (21). Let

g ( x ) = 40eD 1D4x2b
and
f ( x ) = ( D 1D 2 -- 30x 2b) ( D 3 D 4 - 30,xb),
on

As f ( x ) and g ( x ) are differential on and inside the contour Ixl = 1 a n d If(x)l > Ig(x)l on I~1 = l, the denominator of the right-hand side of equation (21) has the same n u m b e r of zeros inside = 1 as that of f ( x ) . The zeros of f ( x ) are given by DID 2 - 30ex ~ = 0 and D3D4 - 30ex b = 0. It is evident that D t D 2 - 3 O e x 2 b = O has 2b zeros inside = 1, and D 3 D 4 - 3 O e x b = O has b zeros inside = 1, which may be seen by applying Rouche's theorem separately. Hence the denominator of the right-hand side of equation (21) has 3b zeros inside

Ixl

Ixl=l.
xl= 1 We let these zeros be denoted by xi(s), i = 1, 2 . . . . . 3b. As W(s, x ) is regular inside = 1, the numerator must vanish for these zeros, giving rise to a set of 3b linear equations. The unknowns of equations (21) and (22), i.e. P~(s), Pf.l (s), P~,2(s) [where k = 0, 1, 2 . . . . . (b - 1)1; Ol(s), 02(s), O3(s); ~gl(S), g2(s) and X(s) can be determined by solving equations (19) and (20) together with equations (9)-(14). Now all the 3b unknowns can be determined completely on solving a set of 3b linear equations. Thus W(s, x ) and R2(s, x) can be completely determined. For these, P ~ ( s ) and P~I (s) can be picked up as the coefficient of x" in respective expansion of W(s, x ) and Rl(s, x). P~2(s) and P~3 (s) can be found on solving equations (19) and (20).

Ixl

g ( x ) = 40Ex2b[{s + e(1 -- X) + 38 + 3'}X b

- 381[s +~(1 - x) + 301

[g(x)[ = ]40ex2b[ [[{S + e(1 -- x) + 38 + 3e}X b -- 3Bll

I{s + ~(1 - x ) + 30 I

>. 14O,lx=[Is + ~(1 - x) + 3fl + 3, I [x~[- 381

Is +~(1 - x ) + 30 I
= 140,Ills + ~(1 - x) + 38 + 3, I - 3811s + ~(1 - x) + 30 I

/> 140,l[Is + ~ + 38 + 3 e l - ~[x I - 3811s + ~ +301-~lxl]

= 140'1[Is + = + 38 + 3,1 - = - 381

REFERENCES

Is + ~ + 3 0 I - ~ 1
>/140,l[l~ + 38 + 3 e l - (~ + 38)1[1~ + 3 0 1 - ~1
= 3602e 2,

1. E. J. Craig, Laplace and Fourier Transforms for Electrical Engineers. Holt, Rineheart and Winston, New York (1964). 2. I. P. Singh and N. N. Agarwal, On the server working on a conveyor belt, Iranian J. Sci. Technol. 7, 107-123 (1978).