Use the following digraph to answer Questions
Suppose that a crew can currently complete a job (order-requirement digraph is shown below) in a minimum amount of time.
-Apply the critical-path scheduling algorithm to obtain a priority list.
A) $T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }$
B) $T _ { 4 } , T _ { 1 } , T _ { 2 } , T _ { 6 } , T _ { 5 } , T _ { 3 }$
C) $T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 6 } , T _ { 3 }$
D) $T _ { 4 } , T _ { 1 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }$

Question

Use the following digraph to answer Questions 
Suppose that a crew can currently complete a job (order-requirement digraph is shown below) in a minimum amount of time. 
-Apply the critical-path scheduling algorithm to obtain a priority list.
A) $T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }$ 
B) $T _ { 4 } , T _ { 1 } , T _ { 2 } , T _ { 6 } , T _ { 5 } , T _ { 3 }$ 
C) $T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 6 } , T _ { 3 }$ 
D) $T _ { 4 } , T _ { 1 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }$

Quizplus · Accepted Answer

The critical path is T1 -> T4 -> T2 -> T5 -> T6 -> T3, which has a total duration of 23 time units. Therefore, the priority list should follow this order to minimize the completion time of the job. Choice C correctly lists the tasks in this order.

Use the Following Digraph to Answer Questions Suppose That T1,T4,T2,T5,T3,T6T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }T1​,T4​,T2​,T5​,T3​,T6​

Use the Following Digraph to Answer Questions
Suppose That $T _ { 1 } , T _ { 4 } , T _ { 2 } , T _ { 5 } , T _ { 3 } , T _ { 6 }$