A set of jobs $\text{A, B, C, D, E, F, G, H}$ arrive at time $t= 0$ for processing on turning and grinding machines. Each job needs to be processed in sequence first on the turning machine and second on the grinding machine, and the grinding must occur immediately after turning. The processing times of the jobs are given below.
$\begin{array}{|cl|cI|cI|cI|cI|cI|cI|cI|cI|}\hline
&\text{Job} & \text{A} & \text{B} & \text{C} & \text{D} & \text{E} & \text{F} & \text{G} & \text{H} \\ \hline &\text{Turning (minutes)} & \text{2} & \text{4} &\text{8}&\text{9} &\text{7} &\text{6} &\text{5} &\text{10} \\ \hline &\text{Grinding (minutes)} & \text{6} & \text{1} &\text{3} &\text{7} &\text{9}&\text{5} &\text{2} &\text{4} \\ \hline \end{array}$
If the makespan is to be minimized, then the optimal sequence in which these jobs must be processed on the turning and grinding machines is
- $\text{A-E-D-F-H-C-G-B}$
- $\text{A-D-E-F-H-C-G-B}$
- $\text{G-E-D-F-H-C-A-B}$
- $\text{B-G-C-H-F-D-E-A}$
