Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  are given a set of n jobs and a single processor that can vary its speed dynamically. Each job J_j is characterized by its processing requirement (work) p_j, its release date r_j and its deadline d_j.#R##N# are also given a budget of energy E and  study the scheduling problem of maximizing the throughput (i.e. the number of jobs that are completed on time). While the preemptive energy minimization problem has been solved in polynomial time [Yao et al., FOCS'95], the complexity of the problem of maximizing the throughput remained open until now.  ansr partially this question by providing a dynamic programming algorithm that solves the problem in pseudo-polynomial time. While our result shows that the problem is not strongly NP-hard, the question of whether the problem can be solved in polynomial time remains a challenging open question. Our algorithm can also be adapted for solving the ighted version of the problem where every job is associated with a ight w_j and the objective is the maximization of the sum of the ights of the jobs that are completed on time.
['Eric Angel', 'Evripidis Bampis', 'Vincent Chau']
I am writing a research paper on a idea Throughput Maximization in the Speed-Scaling Setting
[{"from": "human", "value": "I am writing a research paper on a idea Throughput Maximization in the Speed-Scaling Setting"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  are given a set of n jobs and a single processor that can vary its speed dynamically. Each job J_j is characterized by its processing requirement (work) p_j, its release date r_j and its deadline d_j.#R##N# are also given a budget of energy E and  study the scheduling problem of maximizing the throughput (i.e. the number of jobs that are completed on time). While the preemptive energy minimization problem has been solved in polynomial time [Yao et al., FOCS'95], the complexity of the problem of maximizing the throughput remained open until now.  ansr partially this question by providing a dynamic programming algorithm that solves the problem in pseudo-polynomial time. While our result shows that the problem is not strongly NP-hard, the question of whether the problem can be solved in polynomial time remains a challenging open question. Our algorithm can also be adapted for solving the ighted version of the problem where every job is associated with a ight w_j and the objective is the maximization of the sum of the ights of the jobs that are completed on time."}]