7. The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year. The provost has decided the best way to take a first cut at all these applications is by employing a line process. The following table shows the times and predecessors for the various tasks:

a. (**) Draw a precedence diagram for the tasks.
Suppose the university needs to process 30 applications an hour during the peak season.What is the takt time? What is the theoretical minimum number of workstations?

b. (**) Develop workstation assignments using the “largest eligible task” rule.

c. (**) How many workstations does your solution require? What is the cycle time for the line? What is the idle time? What are the percent idle time and the efficiency delay?

d. (***) In theory, what is the fastest cycle time possible, given the tasks just listed? How many applications per hour does this translate into?

Transcribed Image Text:

TASK TIME (MINUTES) IMMEDIATE PREDECESSOR A 1.2 None B 1 A C 0.65 B D 1.1 B E 1.3. C F 0.7 D G 0.8 D H 0.9 E, F, G