The flexible job shop scheduling problem (FJSSP) is a difficult and complex problem, proved to be NP-hard, in manufacturing environments, because it has to assign each operation to the appropriate machine besides sequencing operations on machines. Due to that complexity, metaheuristics became the best choice to solve in practice this kind of problem. Therefore, the aim of this paper is to offer a reliable compendium in order to cover a wide algorithmic spectrum of different techniques. Further, a study of their accuracy and computational effort is carried out in order to achieve a behavior comparison. This paper shows different algorithmic trends that can be observed through this analysis.Eje: XVIII Workshop de Agentes y Sistemas Inteligentes (WASI).Red de Universidades con Carreras en Informática (RedUNCI
