Apply the CDS (Campbell, Dudek, and Smith) Algorithm to obtain an efficient solution for the following 4-job 4-machine flow shop scheduling problem with an objective of minimizing the makespan. (35) Job (j) pj p2j p3j p4j 1

2 3 4 X 3 7 8Y6 5 2 5 9 Y 4 3 X N N (X= 3, Y = 5, Z = 7, if the last digit of your school no is either 0 or 7) (X= 4, Y = 6, Z = 8, if the last digit of your school no is either 1 or 8) (X= 5, Y = 7, Z = 9, if the last digit of your school no is either 2 or 9)

Apply the CDS (Campbell, Dudek, and Smith) Algorithm to obtain an efficient solution for the following 4-job 4-machine flow shop scheduling problem with an objective of minimizing the makespan. (35) (X=3,Y=5,Z=7, if the last digit of your school no is either 0 or 7) (X=4,Y=6,Z=8, if the last digit of your school no is either 1 or 8) (X=5,Y=7,Z=9, if the last digit of your school no is either 2 or 9) (X=6,Y=8,Z=3, if the last digit of your school no is either 3 or 5 ) (X=7,Y=9,Z=4, if the last digit of your school no is either 4 or 6)