Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   present two simulated annealing algorithms (sequential and parallel) for the permutation flow shop sequencing problem with the objective of minimizing the flowtime.  propose a neighbourhood using the so-called blocks of jobs on a critical path and specific accepting function.  also use the lor bound of cost function. By computer simulations on Taillard [17] and other random problems, it is shown that the performance of the proposed algorithms is comparable with the random heuristic technique discussed in literature. The proposed properties can be applied in any local search procedures.
['Mieczysław Wodecki', 'Wojciech Bożejko']
I am writing a research paper on a idea Solving the flow shop problem by parallel simulated annealing
[{"from": "human", "value": "I am writing a research paper on a idea Solving the flow shop problem by parallel simulated annealing"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   present two simulated annealing algorithms (sequential and parallel) for the permutation flow shop sequencing problem with the objective of minimizing the flowtime.  propose a neighbourhood using the so-called blocks of jobs on a critical path and specific accepting function.  also use the lor bound of cost function. By computer simulations on Taillard [17] and other random problems, it is shown that the performance of the proposed algorithms is comparable with the random heuristic technique discussed in literature. The proposed properties can be applied in any local search procedures."}]