Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of nonpreemptively scheduling a set of independent jobs on a set of uniform machines, where each job has a set of machines to which it can be assigned. This kind of restriction is called the processing set restriction. In the literature there are many kinds of processing set restrictions that have been studied.   consider two kinds: the “inclusive processing set” and the “tree-hierarchical processing set”. Epstein and Levin (2011) have given Polynomial Time Approximation Schemes (PTAS) to solve both classes. Hover, the running times of their PTAS are rather high. ,  give fast approximation algorithms for both cases and show that they both have a worst-case performance bound of 4/3. Moreover,  show that the bounds are achievable.
['Joseph Y.-T. Leung', 'C. T. Ng']
I am writing a research paper on a idea Fast approximation algorithms for uniform machine scheduling with processing set restrictions
[{"from": "human", "value": "I am writing a research paper on a idea Fast approximation algorithms for uniform machine scheduling with processing set restrictions"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of nonpreemptively scheduling a set of independent jobs on a set of uniform machines, where each job has a set of machines to which it can be assigned. This kind of restriction is called the processing set restriction. In the literature there are many kinds of processing set restrictions that have been studied.   consider two kinds: the \u201cinclusive processing set\u201d and the \u201ctree-hierarchical processing set\u201d. Epstein and Levin (2011) have given Polynomial Time Approximation Schemes (PTAS) to solve both classes. Hover, the running times of their PTAS are rather high. ,  give fast approximation algorithms for both cases and show that they both have a worst-case performance bound of 4/3. Moreover,  show that the bounds are achievable."}]