Q.1. The COMSOAL algorithm presented in the class does not incorporate the ZS and ZD constraints [ZS: set of job-pairs that must be done on the same station; ZD: set of job pairs that must not be done on same station ]
Write the modified algorithm that will incorporate these constraints. Your pseudo-code must contain all important details.

Q.2. The precedence diagram is a directed graph. Is it possible for this graph to have cycles ? Why ?

Q.3. [Exer 2.10 of text-book]

The following figure is the precedence diagram for the assembly of a product. Taks times are shown in minutes. The cycle time is 40 minutes.

(a) Find a lower bound on the number of workstations required.

(b) Balance the line using the RPW heuristic.

(c) Is your solution optimal (give reason) ?