The problem of minimizing the weighted number of tardy task units on a
single processor is considered. We give an O(n log n + kn)-time algor
ithm for a set of n tasks with k distinct weights. The relation of thi
s problem with that of minimizing the total weighted error in the impr
ecise computation model is also discussed.