Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The paper presents the comparison of optimality and robustness beten Greedy Randomized Adaptive Search Procedure (GRASP), Simulated Annealing (SA) and Tabu Search (TS) metaheuristics in solving of flexible job shop problem (FJSP). Each of the scheduling problems have been tested with metaheuristics and have been run a number of times to get the best solution. All the results have been analyzed on certain parameter of performance for the metaheuristics - makespan. Overall, testing shod that the TS+GRASP algorithm was slightly more competitive than the SA+GRASP algorithm in the optimality and robustness test. The robustness of the algorithm increased as the best solutions produced by the algorithm re closer to the know optimal.
['Tadeusz Witkowski', 'Arkadiusz Antczak', 'P. Antczak']
I am writing a research paper on a idea Comparison of optimality and robustness between SA, TS and GRASP metaheuristics in FJSP problem
[{"from": "human", "value": "I am writing a research paper on a idea Comparison of optimality and robustness between SA, TS and GRASP metaheuristics in FJSP problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The paper presents the comparison of optimality and robustness beten Greedy Randomized Adaptive Search Procedure (GRASP), Simulated Annealing (SA) and Tabu Search (TS) metaheuristics in solving of flexible job shop problem (FJSP). Each of the scheduling problems have been tested with metaheuristics and have been run a number of times to get the best solution. All the results have been analyzed on certain parameter of performance for the metaheuristics - makespan. Overall, testing shod that the TS+GRASP algorithm was slightly more competitive than the SA+GRASP algorithm in the optimality and robustness test. The robustness of the algorithm increased as the best solutions produced by the algorithm re closer to the know optimal."}]