want to maxmize weight by scheduling Greedy no longer works Dynamic Programming define the subproblem == Rx R == nubmer of request , x == f(i) finishing time , Rf(i) ~= request later than f(i) Rx = {j ∈ R|s(j) ≥ x} given particular x i can always shrink nubmer of request that i have based on {s(j} >=x} (rule) Dp guessing Try each request i as a possible First Solution // n subproblems * subprobl..
