Consider the following instance of the job shop problem with the minimum makespan as the objective where the processing times pij of jobs j=1, 2, 3 on machines i =1, 2, 3 are given in the table (Jm // Cmax)

Jobs	Machine Sequence	Processing Times
1	1,2	p11=9, p21=3
2	1,3	p12=5, p32=8
3	3,2	p33=7, p23=2

(a)Draw a disjunctive graph representation of the job shop including conjunctive and disjunctive relations.

(b)Apply the shifting bottleneck heuristic to this instance of the job shop problem with the aim of minimising the makespan.

(c) Draw the final schedule of the machines (Gannt Chart)