Comparison of neighbourhood search heuristics for the flow shop sequencing problem.
Comparision of simulated annealing heuristics for flow shop sequencing.
Minimal makespan flow shop sequencing by an adaptive hybrid tabu search simulated ...
Clustering Search applied to the capacitated centered clustering problem: a parall...
Applying the simulated annealing to the electrical impedance tomography aiming the...