Determine the Processing Sequence for the Six Jobs Shown in the Following

Essay

Determine the processing sequence for the six jobs shown in the following table using Johnson's rule. Calculate total throughput time. Can the makespan be reduced by splitting the latest job? If so, by how much?
$\begin{array}{ccc} & \text { Processing Time (hrs) } \\\text { Job } & \text { ST1 } & \text { ST2 } \\\hline \text { a } & 4 & 6 \\\text { b } & 9 & 8 \\\text { c } & 10 & 5 \\\text { d } & 6 & 9 \\\text { e } & 9 & 7 \\\text { f } & 12 & 10\end{array}$