Problem $22-12($Algo$)$

Seven jobs must be processed in two operations: A and $B.$ All seven jobs must go through A and $B$ in that sequence$-$A first, then $B.$

Determine the optimal order $($shortest flow time to complete all the jobs$)$ in which the jobs should be sequenced through the process using these times:

$\backslash$table$[[$Job$,\backslash$table$[[$Process A$],[$Time$]],\backslash$table$[[$Process B$],[$Time$]],\backslash$table$[[$Position in$],[$Sequence$]]],[1,9,8,],[2,7,8,7],[3,9,5,5],[4,7,6,7],[5,1,2,],[6,2,3,],[7,4,5,]]$