Answer the last question on the Single machine $2ppt$ file:

$\backslash$table$[[,$Jobs,A$,$B$,$C$,$D$,$E$,$F$],[,,,,,,,],[$procTime$,$Pj$,3,7,11,2,6,14],[$due$,dj,5,8,14,18,20,25],[$Weight$,$Wj$,1,2,2,3,1,3]]$

First requirement: Use Modified Due Date Rule to iteratively find the sequence that will minimize Total Tardiness $($no weighted tardiness here!$)$

Second requirement: Create a branch$-$and$-$bound search tree to find the sequence that will minimize total weighted tardiness of the six jobs. $($This is a very big search tree that will go at least $5$ layers deep. So figure out a way to write out your solution on paper. $)$