Suppose you have the following project digraph. (The numbers in ...

[Deast7027]

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Consider the following timeline using three processors.

◦ This timeline is an illegal schedule because task F was started before task E was completed.
◦ This timeline is an illegal schedule because task E was started before task C was completed.
◦ This timeline is not an optimal schedule because the project can be scheduled with a finishing time of 11 hours.
◦ This timeline is an optimal schedule for three processors.
◦ none of these

[Loise Hard]

This timeline is an illegal schedule because task F was started before task E was completed.

[sjones]

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Consider the following timeline using three processors.

◦ This timeline is not optimal because task F was started after processor 3 was idle for 2 hours.
◦ This timeline is not an optimal schedule because the project can be scheduled with a finishing time of 12 hours.
◦ This timeline is an illegal schedule because task E was started before task C was completed.
◦ This timeline is an optimal schedule for three processors.
◦ none of these

[jomama]

This timeline is an optimal schedule for three processors.

[jhjkgdfhk]

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Consider the following timeline using two processors.

◦ This timeline is an optimal schedule.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ This is the timeline one gets using the critical-path algorithm.
◦ This timeline is an illegal schedule.
◦ none of these

[djpooyouma]

This is the timeline one gets using the decreasing-time algorithm.

[mydiamond]

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Consider the following timeline using two processors.

◦ This timeline is an illegal schedule.
◦ This timeline is an optimal schedule.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ This is the timeline one gets using the critical-path algorithm.
◦ none of these

[Joy Chen]

This timeline is an illegal schedule.

[bio_gurl]

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Consider the following timeline using two processors.

◦ This timeline is an optimal schedule.
◦ This timeline is an illegal schedule.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ This is the timeline one gets using the critical-path algorithm.
◦ none of these

[frre432]

This is the timeline one gets using the critical-path algorithm.