Before revision:  and total weighted completion, and present enhanced DPs for these problems. The resulting computational complexity achieved is O(nU), where n is the number of jobs and U is the upper bound on the total rejection cost .
After revision:  and total weighted completion, and present enhanced DP solutions demonstrating both theoretical and practical improvements .