Eight jobs are to be processed through a single machine.

The precedence relationships that must be satisfied are:

$2->6->3$

$1->4->7->8$

The processing times and due dates are:

Job Processing time Due date

$125$

$234$

$3213$

$416$

$5412$

$6310$

$7215$

$8219$

Determine the sequence in which these jobs should be done in order to minimize the maximum lateness subject to the precedence restrictions.

Based on the optimal sequence: $($Enter integer only$)$

The first job to be processed is Job

$.$

The third job to be processed is Job

$.$

The fourth job to be processed is Job

$.$

The fifth job to be processed is Job

$.$

The eighth job to be processed is Job