Comment on "On-line scheduling policies for a class of IRIS real-time tasks"

Scheduling policies for real-time tasks which receive rewards that depend on the amount of service received were presented by Dey et al.(1996). The policies utilized heuristic approaches to maximize the total accrued reward. In this comment, we propose an extension of their work that may reduce the average computational complexity.