Draw the precedence diagram for these tasks, make a list of all predecessors and all

successors for each task and calculate the lower bound on the number of workstations

necessary in the line.

b$)$ Use the COMSOAL procedure to generate ONE assignment of workstations, break times

by selecting the job with Smaller Processing Time

c$)$ Use the Ranked Positional Weight heuristic to find a good assignment of tasks to

workstations.