OM/QM - Team Exercise - Chapter 6 The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year. The provost has decided that 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. Task Time (in minutes) Immediate Predecessor (s) A 1.2 None B 1 A C 0.65 B a.) Draw a precedence diagram for the tasks. b.) What is the total time of all the tasks? c.) List the paths and the time associated with each path (Note: There are more paths listed than you actually need) d.) What is the longest path--the critical path? e.) What is the cycle time for this process? f.) How many applications can they handle per hour? g.) What is Balance Delay (% Idle Time) D 1.1 B E 1.3 C F 1 D G 0.8 D H 0.9 E,F,G a.) b) Total time for all tasks? c.) List the paths and the time associated with each path (Note: There are more paths listed than you actually need) Tasks Total Time Path 1 Path 2 Path 3 Path 4 Path 5 d.) What is the longest path--the critical path? Tasks Total Time Path e.) What is the cycle time for this process? CYCLE TIME = f.) How many applications can they handle per hour? APPLICATIONS/HR = g.) What is Balance Delay (% Idle Time) BALANCE DELAY (%idle time) =