The solution obtained using Hu Level_Scheduling Algorithm 

The time unit to which task J for J = 1..N assigned in the optimal solution is  
SCHEDULE[  1 ]         1
SCHEDULE[  2 ]         1
SCHEDULE[  3 ]         2
SCHEDULE[  4 ]         3
SCHEDULE[  5 ]         4
SCHEDULE[  6 ]         3
SCHEDULE[  7 ]         2
SCHEDULE[  8 ]         5

