We consider systems of tasks where the task execution times are time-d
ependent and where ah tasks have some common deadline. We describe how
to compute in polynomial time a schedule that minimizes the number of
late tasks. This answers a question raised in a recent paper by Ho, L
eung and Wei.