ISyE 3232

Z. She , YL. Chang

Stochastic Manufacturing and Service Models

Fall 2015

Solutions to Homework 11
1. The arrival rate is = 1 (per min); the service rate is = 1/2 (per min) and the reneging
rate is = 1/10 per min. The state space is S = {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)}, where
a state (i, j) corresponds to i customer served by operator A and j customer(s) served by
operator B. The diagram is as follows:

0,0

1,0

0,1

1,1

0,2

1,2

2. Let the state variable represent the number of customers in the system. The transtion diagram
is as below:

3. 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
1

4. For all the sub-problem below, the state space will always be {0, 1, 2, 3}.
(a) The transition diagram for c = 1 is as the following
2

3
1

(b) The transition diagram for c = 2 is as the following

2

2
1+1

3
1+1

(c) The transition diagram for c = 3 is as the following

2

2
1+1

3
1+1+1