This paper considers the development and the analysis of Local Search heuristics to approximate the Minimum Linear Arrangement problem. First of all, we present a new heuristic that we call SS+SA based on the combination of Spectral Sequencing and Simulated Annealing. This algorithm can be efficiently parallelized on distributed memory machines.
Diaz, J., Petit, J., Serna, M., Spirakis, P.G. "Heuristics for the MinLA problem: an empirical and theoretical analysis". 1998.