All information is needed for this question

Twelve tasks, with times and precedence requirements as shown in the following table, are to be assigned to workstations that have a fixed machine cycle time of 1.5 minutes. Two heuristic rules will be tried: (1) greatest positional weight; and (2) greatest number of following tasks. In each case, the tiebreaker will be shortest task time. Task Length (minutes) 0.2 0.9 0.6 0.2 0.4 0.2 0.7 0.3 0.2 Immediate Predecessor