PL
The paper discusses various approaches used to solve flexible job-shop scheduling problem concentrating on formulations proposed in the last ten years. It mainly refers to the applied metaheuristic techniques which have been exploited in this research area. A comparison of presented approaches is attempted, some concluding insights are highlighted. Finally future research directions are suggested.