Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval.  is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized.  show that the maximization problem is NP-hard for both nonpreemptible and preemptible jobs.  develops two approximation algorithms for nonpreemptible and preemptible jobs. When jobs are nonpreemptible, algorithm LECF is with a 2-approximation factor; when jobs are preemptible, algorithm LEF is proved being a 3-approximation algorithm.  also show that our analysis on the two algorithms is tight by providing a set of input instances. Simulation results demonstrate that algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms.
['Jian-Jia Chen', 'Jun Wu', 'Chi-Sheng Shih', 'Tei-Wei Kuo']
I am writing a research paper on a idea Approximation algorithms for scheduling multiple feasible interval jobs
[{"from": "human", "value": "I am writing a research paper on a idea Approximation algorithms for scheduling multiple feasible interval jobs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval.  is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized.  show that the maximization problem is NP-hard for both nonpreemptible and preemptible jobs.  develops two approximation algorithms for nonpreemptible and preemptible jobs. When jobs are nonpreemptible, algorithm LECF is with a 2-approximation factor; when jobs are preemptible, algorithm LEF is proved being a 3-approximation algorithm.  also show that our analysis on the two algorithms is tight by providing a set of input instances. Simulation results demonstrate that algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms."}]