Question: Eight jobs are to be processed through a single machine. The processing times and due dates are given here.
Job 1 2 3 4 5 6 7 8
Processing time 2 3 2 1 4 3 2 2
Due date 5 4 13 6 12 10 15 19
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.