A flow shop consists of 3-Machines on which 4-Jobs have to be scheduled in a fixed sequence. The process times of the four jobs are given in the table below. In this table P1, P2, and p3, indicate the process time of the jth job on Machine-1, Machine-2 and Machine-3 respectively. Work out a near-optimum schedule of processing the jobs for heuristically minimizing the Makespan using Palmer's Method. Job (j) P P2j P3j J 3 5 6 J 6 5 3 4 4 2 JA 8 2 4 Calculate the following: (i) The Minimum and the Maximum Processing Times on the 3-machine and hence conclude whether the machines satisfy the Johnson's criteria for 3- machines. (ii) Calculate the slope-index and hence decide the heuristic schedule; (iii) Calculate the Directed Graph and Gant Chart; (iv) Hence calculate the value of Makespan, Cmax.