Table $1$ displays the operation order and processing time $($in hours$)$ for individual jobs on respective machine centers. Propose three job scheduling algorithms and find the best algorithm to minimize makespan. Draw the Gantt chart.

Table $1.$ Processing Time $($in Hours$)$ for Job $1-10$ on Machine $1-6$

$\backslash$table$[[$Jobs$,$M$1,$M$2,$M$3,$M$4,$M$5,$M$6],[$J$1,0,15,0,0,0,0],[$J$2,0,18,0,0,0,0],[$J$3,58,17,30,10,0,0],[$J$4,0,48,32,35,25,20],[$J$5,60,55,15,0,0,0],[$J$6,55,33,20,0,0,0],[$J$7,58,15,20,10,0,0],[$J$8,60,27,0,0,0,5],[$J$10,0,0,12,50,0,5]]$