2013

Conférence

ICSI

Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine and has a processing time depending on the machine used. The objective is to minimize the makespan, i.e., the total duration of the schedule. In this article, we propose a multi-agent model based on the hybridization of the tabu search (TS) method and particle swarm optimization (PSO) in order to solve FJSP. Different techniques of diversification have also been explored in order to improve the performance of our model. Our approach has been tested on a set of benchmarks existing in the literature. The results obtained show that the hybridization of TS and PSO led to promising results.

Henchiri, A., Ennigrou, M. (2013). Particle Swarm Optimization Combined with Tabu Search in a Multi-agent Model for Flexible Job Shop Problem. In: Tan, Y., Shi, Y., Mo, H. (eds) Advances in Swarm Intelligence. ICSI 2013. Lecture Notes in Computer Science, vol 7929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38715-9_46