Problem $3.$ Eight jobs are to be processed through a single machine. The processing times and due dates are given here. Furthermore, assume that the following precedence relationships must be satisfied:

$[2->6->3$; $1->4->7->8]$

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