An FPTAS for scheduling with piecewise linear decreasing processing times to minimize makespan

Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Scheduling with time-dependent execution times

We consider systems of tasks where the task execution times are time-dependent and where all 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, Leung and Wei