Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Garey, E.L., Johnson, D.S., Sethi, R.: The Complexity of Flow-shop and Job-shop scheduling. Mathematics of Operations Research 1, 117–129 (1976)
Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research 4(1-4), 157–183 (1993)
Kacem, I., Hammadi, S., Borne, P.: Approach by Localization and Multi-Objective Evolutionary Optimization for Flexible Job Shop Scheduling Problems. IEEE Trans. Systems, Man and Cybernetics 32(1), 1–13 (2002)
Kacem, I., Hammadi, S., Borne, P.: Pareto-Optimality Approach for Flexible Job Shop Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic. Mathematics and Computers in Simulation 60, 245–276 (2002)
Zhang, G., Shao, X., Li, P., Gao, L.: An effective hybrid particle swarm optimization algorithm for multi objective flexible job-shop scheduling problem. Computers and Industrial Engineering 56(4), 1309–1318 (2009); Moslehi, G., Mahnam, M.: Int. J. Production Economics 129 (2009)
Dauzère-Pérès, S., Paulli, J.: An Integrated Approach for Modeling and Solving the General Multiprocessor Job Shop Scheduling Problem using Tabu Search. Annals of Operations Research 70(3), 281–306 (1997)
Mastrolilli, M., Gambardella, M.L.: Effective Neighborhood Functions for the Flexible Job Shop Problem. J. Scheduling 3(1), 3–20 (2000)
Liu, H., Abraham, A., Choi, O., Moon, S.H.: Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 197–204. Springer, Heidelberg (2006)
Ennigrou, M., Ghédira, K.: Approche Multi-Agents basée sur la Recherche Tabou pour le Job Shop flexible. In: RFIA, 14ème Congrès Francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle, Toulouse, France (2004)
Ennigrou, M., Ghédira, K.: New local diversification techniques for the Flexible Job Shop problem with a Multi-agent approach. JAAMAS, Journal of Autonomous Agents and Multi-Agent Systems 17(2), 270–287 (2008)
Duvivier, D.: Etude de l’hybridation des méta-heuristiques, application a un problème d’ordonnancement de type job shop. Université du Littorial côté d’opale (2000)
Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 5, 533–549 (1986)
Kennedy, J., Eberhar, R.C.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, Piscataway, pp. 1942–1948 (1995)
Hurink, E., Jurisch, B., Thole, M.: Tabu search for the job shop scheduling problem with multi-purpose machine. Operations Research Spektrum 15, 205–215 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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
Download citation
DOI: https://doi.org/10.1007/978-3-642-38715-9_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38714-2
Online ISBN: 978-3-642-38715-9
eBook Packages: Computer ScienceComputer Science (R0)