Scheduling Application Tasks using Greedy Algorithm

• Each task has a Weight (to indicate priority) and Length (to indicate run time)
• For each task, we compute a score = weight/time and sort them in decreasing order (from large to small)
• We then run the task starting from the largest score