Question

There is a very simple greedy algorithm(Pseudocode) that maximizes your total reward. Find it.

Consider the following scheduling problem. Each task I has a length L[I] and a deadline D[I].

There is a single processor that handles one task at a time. Let E[I] be the ending time of I under a given schedule.

You get paid an amount D[I] − E[I] if you finish task I early and you get fined an amount E[I] − D[I] if you finish task I late.

Answer 1

Greedy Approach:

Sort all tasks in ascending order of their length

consider an array of tasks Tasks[I] sort it

for(task t : allTasks)

{

process smallest length task

calculate profit

smallest length task will be farthest from the deadline and will earn more profit

}

since we kept picking task which gives more profit initially(irrespective of final result) this approach is greedy.