ISYE 3232C Fall 2015 Quiz 11

I,
, do swear that I abide by the Georgia Tech Honor Code. I understand that
any honor code violation will result in a zero for this test and one letter grade reduction.
Signature:
1. (5) Consider a service system with a single server whose service time is exponentially distributed with
rate and infinite capacity. The arrivals come to the system following a Poisson process of rate but
an arrival finding i people in the system will enter the system with probability 1/(i + 1). For example
at the time of your arrival if there are 2 people in the system you will enter with probability 1/3.
Customers are willing to wait an exponentially distributed length of time with rate before reneging
(i.e., leaving the waiting queue line) if service has not begun.
Describe a continuous time Markov chain to model the system and give the rate transition diagram.
1
2

1
3

, with the state space being S = {0, 1, 2, 3, }

...

2
+

1
4

2 +

3 +

2. (5) Suppose we have a small call center staffed by two operators A and B handling three telephone
lines. Operator A only handles line 1, and B handles only line 2 and 3. Calls arrive according to a
Poisson process with rate = 60 calls per hour. All arrivals prefer line 1. Arrivals find all lines are
busy will go away. Operator As processing times are iid exponential with mean 4 minutes. Operator
Bs processing times are iid exponential with mean 6 minutes.
Describe a continuous time Markov chain to model the system and give the rate transition diagram.
The state space is S = {(0, 0), (1, 0), (1, 1), (1, 2), (0, 2), (0, 1)}, where (i, j) represents there are i customer(s) served by operator A and j customer(s) served by operator B.
The rate transition diagram, with
= 1 call per minute
1 =
2 =

1
4
1
6

call per minute

call per minute,

is
1,0

1,1

1,2

0,0

0,1
2

0,2