Create a 3-machine flow-shop problem with 10 jobs. Then create an artificial 2-machine problem based on your original problem where processing times on the artificial machine are Pi1+Pi2 and Pi2+Pi3 respectively. Apply Johnson's algorithm to the artificial problem to find a sequence. Apply the sequence found to the original problem. Find the completion time and then draw the Gantt Chart.