1) Suppose you are given the following sequential process. Times to complete each task are shown in parentheses. There are no inventory buffers between tasks, so upstream tasks must wait if downstream tasks are busy.

Task 1 (11 minutes) ----> Task 2 (15 minutes) ----> Task 3 (10 minutes)

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

Use this information to answer the next 4 questions. All answers are in customers and/or minutes, where appropriate.

What is the throughput time for the entire process (from the start of Task 1 through the end of Task 3)?

A) Less than 5

B) Greater than or equal to 5 but less than 5

C) Greater than or equal to 5 but less than 10

D) Greater than or equal to 10 but less than 15

E) Greater than or equal to 15

2) What is the cycle time for task 2 in minutes? Pick the closest answer.

A) 1

B) 2.5

C) 5

D) 10

E) 20

3) 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) How many customers will leave Task 3 in one hours?

A) .1

B) .4

C) 1

D) 6

E) 10