Question 3.35
5. Schedule the six tasks of the job indicated in the accompanying order-requirement digraph on one processor, using the list-processing algorithm and the list T1, T2, T3, T4, T5, T6.
5.
The tasks would be scheduled so that T1 gets done from 0 to 1, T2 from 1 to 6, T4 from 6 to 12, T3 from 12 to 14, T5 from 14 to 17, and T6 from 17 to 21. Even though there is only one machine, the tasks don't appear in the schedule in the order they appear in the list because of restrictions in task order due to the order-requirement digraph.