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.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.