Question 3.53

23. Given the order-requirement digraph below, answer the following questions.

image
  1. Find the length of the shortest path from T1 to T2.
  2. What is the length of the critical path?
  3. Give a schedule that completes the tasks by the time length of the critical path on two machines, or explain why this is not possible. (If it is possible, provide a list that gives rise to this schedule.)

23.

(a) 15

(b) 19

(c) Use the list to obtain the following schedule:

image