Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Most scheduling problems belong to the class of NP hard problems. Because of that reason, search based approaches are often used in order to find solutions for scheduling problems.   compare several search-based approaches for finding solutions for the unrelated machines scheduling problem. These search based approaches use two different solution representations for the aforementioned problem and the representations are compared with each other. The first representation uses a permutation vector to encode the solution, while the second one uses a vector of floating point numbers. The results of the search based approaches are compared to several existing heuristics developed especially for solving the unrelated machines scheduling problem.  also perform a complexity analysis of the search-based approaches, in which  compute the time needed for them to outperform the problem specific heuristics.
['Marko Durasevic', 'Domagoj Jakobovic']
I am writing a research paper on a idea Comparison of solution representations for scheduling in the unrelated machines environment
[{"from": "human", "value": "I am writing a research paper on a idea Comparison of solution representations for scheduling in the unrelated machines environment"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Most scheduling problems belong to the class of NP hard problems. Because of that reason, search based approaches are often used in order to find solutions for scheduling problems.   compare several search-based approaches for finding solutions for the unrelated machines scheduling problem. These search based approaches use two different solution representations for the aforementioned problem and the representations are compared with each other. The first representation uses a permutation vector to encode the solution, while the second one uses a vector of floating point numbers. The results of the search based approaches are compared to several existing heuristics developed especially for solving the unrelated machines scheduling problem.  also perform a complexity analysis of the search-based approaches, in which  compute the time needed for them to outperform the problem specific heuristics."}]