Given a set of n jobs with [start time, end time, cost] find a subset so that no 2 jobs overlap and the cost is maximum.Now I'm not sure if a greedy algorithm will do the trick. That is, sort by cost and always take the next job that doesn't intersect and with max cost between the two.Is this equivalent to a knapsack problem? How could I approach it?
Find non-overlapping scheduled jobs with maximum cost
algorithms;scheduling;greedy algorithms;knapsack problems