An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem

Flexible job-shop scheduling problem (FJSP) is very important in many research fields such as production management and combinatorial optimization. The FJSP problems cover two difficulties namely machine assignment problem and operation sequencing problem. In this paper, we apply particle swarm optimization (PSO) algorithm to solve this FJSP problem aiming to minimize the maximum completion time criterion. Various benchmark data taken from literature, varying from Partial FJSP and Total FJSP, are tested. Experimental results proved that the developed PSO is enough effective and efficient to solve the FJSP. Our other objective in this paper, is to study the distribution of the PSO-solving method for future implementation on embedded systems that can make decisions in real time according to the state of resources and any unplanned or unforeseen events. For this aim, two multi-agent based approaches are proposed and compared using different benchmark instances.

[1]  Meriem Ennigrou,et al.  Particle Swarm Optimization Combined with Tabu Search in a Multi-agent Model for Flexible Job Shop Problem , 2013, ICSI.

[2]  Abdelghani Bekrar,et al.  An effective particle swarm optimization algorithm for flexible job-shop scheduling problem , 2013, Proceedings of 2013 International Conference on Industrial Engineering and Systems Management (IESM).

[3]  Parviz Fattahi,et al.  A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem , 2015, J. Intell. Manuf..

[4]  Ning-Sheng Wang,et al.  An Improved PSO Algorithm for Flexible Job Shop Scheduling with Lot-Splitting , 2009, 2009 International Workshop on Intelligent Systems and Applications.

[5]  Kamran Zamanifar,et al.  An agent-based parallel approach for the job shop scheduling problem with genetic algorithms , 2010, Math. Comput. Model..

[6]  J. Kennedy,et al.  Neighborhood topologies in fully informed and best-of-neighborhood particle swarms , 2003, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[7]  Khaled Ghédira,et al.  New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach , 2008, Autonomous Agents and Multi-Agent Systems.

[8]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[9]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[10]  S. Meeran,et al.  A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study , 2011, Journal of Intelligent Manufacturing.

[11]  Yan Chen,et al.  Multi-agent based genetic algorithm for JSSP , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[12]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives , 2016, J. Intell. Manuf..

[13]  Jaroslaw Sobieszczanski-Sobieski,et al.  A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations , 2005 .

[14]  Quan-Ke Pan,et al.  A Hybrid Particle Swarm Optimization and Tabu Search Algorithm for Flexible Job-Shop Scheduling Problem , 2010 .

[15]  Abid Ali Khan,et al.  A Genetic Algorithm for Flexible Job Shop Scheduling , 2013 .

[16]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[17]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[18]  Lin Lin,et al.  Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey , 2014, J. Intell. Manuf..

[19]  Abdelghani Bekrar,et al.  Coupling a genetic algorithm with the distributed arrival-time control for the JIT dynamic scheduling of flexible job-shops , 2014 .

[20]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[21]  Péricles B. C. de Miranda,et al.  Dynamic Clan Particle Swarm Optimization , 2009, 2009 Ninth International Conference on Intelligent Systems Design and Applications.

[22]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[23]  Peng-Jen Lai,et al.  Using heuristic algorithms to solve the scheduling problems with job-dependent and machine-dependent learning effects , 2013, Journal of Intelligent Manufacturing.

[24]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[25]  Mark M. Meerschaert,et al.  Mathematical Modeling , 2014, Encyclopedia of Social Network Analysis and Mining.

[26]  Yu-Xuan Wang,et al.  Particle Swarms with dynamic ring topology , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[27]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[28]  Fernanda M. P. Raupp,et al.  A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem , 2016, J. Intell. Manuf..

[29]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[30]  Xiong Wei,et al.  Multi-agent system for flexible job-shop scheduling problem based on human immune system , 2012, Proceedings of the 31st Chinese Control Conference.

[31]  Jun Tang,et al.  An improved particle swarm optimization for multi-objective flexible job-shop scheduling problem , 2007, 2007 IEEE International Conference on Grey Systems and Intelligent Services.

[32]  Nhu Binh.  Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search , 2008 .

[33]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[34]  S. GirishB.,et al.  A particle swarm optimization algorithm for flexible job shop scheduling problem , 2009, 2009 IEEE International Conference on Automation Science and Engineering.

[35]  Ajith Abraham,et al.  A novel Variable Neighborhood Particle Swarm Optimization for multi-objective Flexible Job-Shop Scheduling Problems , 2007, 2007 2nd International Conference on Digital Information Management.

[36]  N. Jawahar,et al.  A particle swarm optimization algorithm for flexible jobshop scheduling problem , 2009, CASE 2009.

[37]  Heydari Mahdi,et al.  SOLVING FLEXIBLE JOB SHOP SCHEDULING WITH MULTI OBJECTIVE APPROACH , 2010 .

[38]  Mehmet Emin Aydin.  Coordinating metaheuristic agents with swarm intelligence , 2012, J. Intell. Manuf..

[39]  Guoji Zhang,et al.  A Hybrid Algorithm for Flexible Job-Shop Scheduling Problem , 2011 .

[40]  Khaled Ghédira,et al.  Combining Tabu Search and Genetic Algorithm in a Multi-agent System for Solving Flexible Job Shop Problem , 2012, 2012 11th Mexican International Conference on Artificial Intelligence.

[41]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..