SCENARIO A: 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

What is the throughput time for the three-task sequence (in minutes)? Pick the closest answer

SCENARIO A:

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.

All answers are in customers and/or minutes, where appropriate.

What is the throughput time for the three-task sequence (in minutes)? Pick the closest answer

10

15

20

25

30

35

40