A note on single-processor scheduling with time-dependent execution times

We consider a single-processor scheduling model where the execution time of a task is a decreasing linear function of its starting time. The complexity of the problem of minimizing the number of late tasks remains unknown for a set of tasks with identical due dates. We present an O(n^2)-time dynamic programming algorithm for solving this problem.