Multiple Choice
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.
-If Task T1 is shortened from 7 minutes to 4 minutes, then what is the maximum amount of time by which the completion time of the entire job can be shortened?
A) It cannot be shortened
B) 1 minute
C) 2 minutes
D) 3 minutes
Correct Answer:

Verified
Correct Answer:
Verified
Q59: Use the decreasing-time-list algorithm to schedule these
Q60: Choose the packing that results from
Q61: Use the order-requirement digraph below (with time
Q62: Given the order-requirement digraph below (with time
Q63: The order requirements for scheduling tasks depend
Q65: Which of the algorithms-first fit (FF), next
Q66: When scheduling tasks using the list-processing algorithm,
Q67: Find the chromatic number of the graph
Q68: Use the following digraph to answer Questions
Q69: What is the minimum number of machines