(1) Suppose you are given the following sequential process. Throughput times are shown in parentheses. There are no inventory buffers between tasks, so upstream tasks must wait if downstream tasks are busy.

Task 1 (5 minutes) ----> Task 2 (4 minutes) ----> Task 3 (10 minutes)

Task 1 can handle 2 customers at once; Task 2 can handle 1 customer at a time; Task 3 can handle 5 customers at a time.

What is the throughput time (in minutes) for the entire process (from the start of Task 1 through the end of Task 3)? Pick the closest answer.

A) 5

B) 10

C) 15

D) 20

E) 25

(2) Refer to Scenario A:

What is the (theoretical, best-case) cycle time for Task 3 in minutes? Pick the closest answer.

A) .5

B) 2

C) 4

D) 5

E) 10

F) 25

(3) Refer to Scenario A:

What is the throughput capacity for Task 1 in customers per minute? Pick the closest answer.

A) .1

B) .2

C) .3

D) .4

E) 1

F) 2

G) 3

H) 10

(4) Refer to Scenario A:

Which task is (are) the bottleneck(s)?

A) Task 1

B) Task 2

C) Task 3

D) Tasks 1 & 2

E) Tasks 1 & 3

F) Tasks 2 & 3