Throughput Maximization in the Speed-Scaling Setting

We are given a set of n jobs and a single processor that can vary its speed dynamically. Each job Jj is characterized by its processing requirement (work) pj , its release date rj and its deadline dj . We are also given a budget of energy E and we study the scheduling problem of maximizing the throughput (i.e. the number of jobs which are completed on time… CONTINUE READING