1.  Earliest completion time is 43 (minutes). The critical path, BCDEG, has length 43 so no completion time can have less than 43 minutes. Each task on this path must wait for the task before it to finish, so it would take 43 minutes for this path alone.

2. Schedule the tasks given in the order-requirement digraph below using the list-processing algorithm on two machines with the priority list.

Yes, it is optimal. The minimal completion time is 20s since there is a critical path T1T4T5 (length 20)

3. Use the critical path scheduling and the order requirement digraph given to schedule the tasks on 3 processors.

Critical path: T2T4T5 (length 17). 
Thus our priority list starts with T2. 

After T2 is taken out, the graph becomes:

Critical path: T1T4T5 (length 13).

After T1 is taken out: Critical path: T4T5 (length 8).

After T4 is taken out: Critical path: T7 (length 5).
After T7 is taken out: Critical path: T3 (length 3).
After T3 is taken out: Critical path: T5 (length 3).
After T5 is taken out: Critical path: T6 (length 2).

Therefore, the priority list is: T2T1T4T7T3T5T6 

The schedule:

4. a. Critical path: T1T2T6 (length 23)

   b. The minimal completion time is 23s.

c. When T1 is reduced to 2, there is a new critical path: T4T5T6 (length 21). The minimum completion time    is reduced to 21s.

5. 

6.   a. next-fit     							b. first fit

c. worst fit decreasing

7. 
a) NF: 4 bins are needed.

b) WFD: 4 bins are needed.

8.  a.                                                            b. one solution