Consider a line balancing problem. Twelve tasks, with times and precedence requirements as shown in the following table, are to be assigned to workstations using a cycle time of 1.2 minutes.

Q5.1 Draw the precedence diagram.

Q5.2 Assign tasks to stations in order of most following tasks first. In case of a tie, use the tiebreaker of assigning the task with the longest processing time first.

Q5.3 In the designed line in Q5.2, which tasks are assigned to workstation 1? Q5.4 In the designed line in Q5.2, calculate the total idle time of all workstations in one cycle.

Q5.5 In the designed line in Q5.2, calculate the efficiency of the line.

Task Immediate Predecessor Length (minutes) 0.1 a none b 0.2 a b 0.9 0.6 d e 0.1 none f 0.2 de f 0.4 g h 0.2 none 0.3 gh 0.7 i i j k 1 0.3 j k 0.2