1.Suppose you have a three task sequence. All customers go to Task A. After task A, 25% of customers go to Task B; the other 75% go to task C. After task B or C, all customers then go to Task D before leaving. No buffers exist between tasks, so blocking/starvation rules apply.

Suppose throughput capacities are as follows. Task A: 10 customers/hour; task B: 5 customers/hour; task C: 6 customers/hour; task D, 9 customers/hour.

At what rate will customers leave task D (in customers/hour)? Assume the 25%/75% split between tasks B & C must always be upheld.

Pick the closest answer.

5

6

7

8

9

10

2.Following the previous 2 questions, what is the bottleneck in the A-C-D process route?

A

B

C

D

E