Greedy Approach - Task selection

Question

Comments

See how I approached the problem ,first I arranged the Tasks in ascending order of their deadline.

Then Except the T2 I selected the task that would maximize the profit in the respective time slots.

for time slot 1 selected T9 --- 20

slot 3 I selected T7 --- 24

slot 4 - T5 --25

slot 5- T 10 - 15

slot 6 - 18

20+24+25+15+18=102

So to get max profit as 129  in slot 2 we select the profit to be 27

@amsar review this !

---

Firstly we order the tasks according to their profits , not deadlines..

---

I tried that way not getting optimal sol.Seems I am missing some point.pls can you explain a bit more !! thanks

Answer 1

Answer will be 25. Steps -

1- Check whether we even need t3 or not. Solve without t3. if the sum is less than the desired we need t3 in the calcuation.
2-Deadline of t3 is 2. Right now T2 is on the the position 2. So if we want to enter the t3. there are tow places for t3 either 1 or 2 for place 1 the profit of t3 should be less than 22. for getting position 2 the profit should be either 22 or greter.
3- If the place is 1. we can't get the required sum. If we place t3 on position 2 it will make 22 to go on position 1. So now after putting t2 on position 1 solve and u will get 25.

Answer 2

x=25 is the answer.

Answer 3

X = 25 is correct answer, as mentioned by Payal earlier. Most probable error we make in this pblm is we consider process t9 in first slot. But eligible ones are t1, t2 and t9. We have to consider 22 profit in slot 1