INFORMATION Kaz's Computing Conglomerate wants to build a new computer assembly line for a new product called the Reverse Notation Assembly (RNA). Tasks, times and order of processing/immediate predecessors is noted below: IMMEDIATE ASSEMBLY PREDECESSORS: TIME AT THIS TASK MUST TASK (in FOLLOW THE seconds) TASK LISTED HERE TASK A 12 B 15 A 8 A D 5 B, C E 20 D Time for Task OR Total Task Time ? Kaz's goal = produce 180 RNA's per hour. QUESTIONS (should you decide to accept them - which you must to obtain 5 points): 1. BALANCE THE ASSEMBLY LINE: DRAW A PRECEDENCE DIAGRAM FOR THIS PROCESS (BE SURE TO INCLUDE THIS CHART AS WELL); 2. CALCULATE YOUR CYCLE TIME 3. CALCULATE YOUR THEORETICAL MINIMUM FOR THE NUMBER OF WORKSTATIONS IN KAZ'S PROCESS 4. CAN THE THEORETICAL MINIMUM BE REACHED - IF YES, SHOW IT BY RECREATING THE PRECEDENCE DIAGRAM WITH EACH OF THE WORKSTATIONS OUTLINED. FOR 1 EXTRA POINT - Tell me about this operations efficiency and idle time - what do these two numbers tell you about this operation? HINT: Note the WORK DAY is expressed as ONE HOUR and make sure to convert everything to the same time element (hours, minutes or seconds)