Immediate Predecessor Time (in Minutes) Task A 1.2 None 1 C 0.65 The local university has developed an eight-step process for screening the thousands of admissions applications it gets cach 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: 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 by 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 effi- ciency delay? d. (***) in theory, what is the fastest cycle time possible, given the tasks listed above? How many applications per hour does this translate into? D 1.1 B Line Balancing Steps 1. Identify all steps, their relationships, and times required. 2.Draw a precedence diagram. 3.Determine takt time (time available divided by desired output rate). 4.Determine minimum number of workstations required (total process time divided by takt time). 5.Assign tasks to workstations according to precedence and total time for each to not exceed takt time. 6.Evaluate solution for times per workstation, % idle time, and efficiency delay (100% -% idle time). , E 1.3 F 1 D G 0.8 D H 0.9 EFG -) E 1.3 0.65 H B 0.9 F F. 0.7 1.2 1 D 1.1 G 0.8 vailable Production Time: equired Output Rate: ask Time per Unit: akt Time: In Number of Workstations 60 Minutes SD Applications 2 Minutes 2 Minutes 3.975 or 4 Workstations ( O -) .)