Suppose we have the following project digraph. (The numbers in parenthesis represent hours.) A(8) (6)1 I(2)...

Transcribed Image Text:

Suppose we have the following project digraph. (The numbers in parenthesis represent hours.) A(8) (6)1 I(2) B(6) Start(0) J(7) F(3) H(5) Co 0 C(7) (G(2) D(4) End(0) Assume that this project is scheduled using three processors, and the decreasing time algorithm. Use this information to fill in the blanks and answer the following questions. (For parts a. c and d enter only a number. For part b. enter only a letter. For part e. answer "yes" or "no") a). The critical time for this project is: b) What will be the first task assigned to Processor 3? c) At what time will time will task G be started? t- hours. d) What is the completion time for the project with this schedule? Completion Time= hours e) Is this schedule optimal? (Type either yes or no) Suppose we have the following project digraph. (The numbers in parenthesis represent hours.) A(8) (6)1 I(2) B(6) Start(0) J(7) F(3) H(5) Co 0 C(7) (G(2) D(4) End(0) Assume that this project is scheduled using three processors, and the decreasing time algorithm. Use this information to fill in the blanks and answer the following questions. (For parts a. c and d enter only a number. For part b. enter only a letter. For part e. answer "yes" or "no") a). The critical time for this project is: b) What will be the first task assigned to Processor 3? c) At what time will time will task G be started? t- hours. d) What is the completion time for the project with this schedule? Completion Time= hours e) Is this schedule optimal? (Type either yes or no)