ISyE 3232

Z. She , YL. Chang

Stochastic Manufacturing and Service Models

Fall 2015

Solutions to Homework 12
1. (a) This process can be modeled as follows: here our state space is S = {(0, 0), (1, 0), (0, 1), (1, 1)}
where a state (i, j) means i customers in server 1 and j customers in server 2.
The generator is as follows (the rate transition diagram can be drawn immediately after
knowledge of the generator) :

(0, 0) (1, 0) (1, 1) (0, 1)

(0, 0) 10
10
0
0

6
16
10
0
G = (1, 0)
.
(1, 1)
0
4
10
6
(0, 1)
4
0
10
14
(b) To find the stationary distribution, we need to again solve the system of balance and
normalizing equations. From the generator, we see that
1000

610 + 401

1610

1000 + 411

1011

1010 + 1001

1401

611

00 + 10 + 11 + 01

Solving this, we that 00 = 18/88, 10 = 20/88, 11 = 35/88 and 01 = 15/88.

(c) The long-run fraction of time that server 1 is busy is 10 + 11 = 55/88. The long-run
fraction of time that server 2 is busy is 11 + 01 = 50/88.
2. For all the sub-problem below, the state space will always be {0, 1, 2, 3}.
(a) The transition diagram is as the following
2

3
1

Solve the stationary distribution using the cut method, we get

= (1/15, 2/15, 4/15, 8/15)
So the throughput is ef f = 2(1 3 ) = 14/15. To find the long-run average waiting
time, we use Littles law. Note that L = 12 + 23 = 20/15, so
W =

L
= 10/7.
ef f

(b) The transition diagram is as the following

2
1+1

3
1+1

Solve the stationary distribution using the cut method, we get

= (1/7, 2/7, 2/7, 2/7)
So the throughput is ef f = 2(1 3 ) = 10/7. To find the long-run average waiting time,
we use Littles law. Note that L = 13 = 2/7, so
W =

L
= 1/5.
ef f

(c) The transition diagram is as the following

2

2
1+1

3
1+1+1

Solve the stationary distribution using the cut method, we get

= (3/19, 6/19, 6/19, 4/19)
So the throughput is ef f = 2(1 3 ) = 30/19. To find the long-run average waiting
time, we use Littles law. Note that L = 0, so
W =

L
= 0.
ef f