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
Published in:
Electronics Letters
(Volume:35
,
Issue:
24
)
Date of Publication: 25 Nov 1999