The Flexible Job Shop scheduling Problem (FJSP) is an extension of the classical Job Shop scheduling Problem (JSP) that allows to process operations on one machine out of a set of alternative machines. It is an NP-hard problem consisting of two sub-problems which are the assignment and the scheduling problems. This paper proposes a hybridization of two metaheuristics within a holonic multiagent model for the FJSP. Firstly, a scheduler agent applies a Neighborhood-based Genetic Algorithm (NGA) for a global exploration of the search space. Secondly, a cluster agents set uses a local search technique to guide the research in promising regions. Numerical tests are made to evaluate our approach, based on two sets of benchmark instances from the literature of the FJSP, which are the Brandimarte and Hurink data. The experimental results show the efficiency of our approach in comparison to other approaches.
Nouri, H. E., Driss, O. B., & Ghédira, K. (2015). Hybrid metaheuristics within a holonic multiagent model for the Flexible Job Shop Problem. In Procedia Computer Science (Vol. 60, pp. 83–92). Elsevier B.V. https://doi.org/10.1016/j.procs.2015.08.107