Low complexity dynamic scheduling algorithm forreal-time tasks
Gu Hyun Jung, T. Kim, Seung hee Park, Kyunghee Choi · Electronics Letters · 1999
It is shown that the problem of maximising the total reward of online tasks can be solved by finding the minimum of the maximum derivatives of the reward functions. Based on the modified approach and a close observation of task arrival characteristics, a heuristic algorithm with average complexity close to O(N) is presented.