A tabu search-based memetic algorithm for the multi-objective flexible job shop scheduling problem

In this paper we propose a tabu search-based memetic algorithm (TSM) for the multi-objective flexible job shop scheduling problem (FJSSP), with the objectives to minimize the makespan, the total workload and the critical workload. The problem is addressed in a Pareto manner, which targets a set of Pareto optimal solutions. The novelty of our method lies in the use of tabu search (TS) as the local search method as well as a mutation operator and the use of the hypervolume indicator to avoid stagnation by increasing the flow of individuals in the local search. To the best of our knowledge, the use of TS in the context of multi-objective FJSSP has not been reported so far. We apply our algorithm on well known test instances and compare our results to state-of-the art algorithms. The results show that our approach yields competitive solutions in 6 of the 10 instances against two of their algorithms proving that the use of TS as a local search method can provide competitive results.

[1]  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.

[2]  Sanghyup Lee,et al.  Flexible job-shop scheduling problems with ‘AND’/‘OR’ precedence constraints , 2012 .

[3]  Cees T. A. M. de Laat,et al.  A Medium-Scale Distributed System for Computer Science Research: Infrastructure for the Long Term , 2016, Computer.

[4]  Nicola Beume,et al.  Multi-objective optimisation using S-metric selection: application to three-dimensional solution spaces , 2005, 2005 IEEE Congress on Evolutionary Computation.

[5]  E. O. Oyetunji,et al.  Some Common Performance Measures in Scheduling Problems: Review Article , 2009 .

[6]  Jian Xiong,et al.  A Hybrid Multiobjective Evolutionary Approach for Flexible Job-Shop Scheduling Problems , 2012 .

[7]  Marc Parizeau,et al.  DEAP: evolutionary algorithms made easy , 2012, J. Mach. Learn. Res..

[8]  Alain Hertz,et al.  5. Tabu search , 2003 .

[9]  X. Shao,et al.  A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem , 2010 .

[10]  G. Moslehi,et al.  A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search , 2011 .

[11]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[12]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[13]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[14]  James A. Reggia,et al.  A cooperative combinatorial Particle Swarm Optimization algorithm for side-chain packing , 2009, 2009 IEEE Swarm Intelligence Symposium.

[15]  Michael T. M. Emmerich,et al.  A tutorial on multiobjective optimization: fundamentals and evolutionary methods , 2018, Natural Computing.

[16]  Mostafa Zandieh,et al.  Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem , 2012, The International Journal of Advanced Manufacturing Technology.

[17]  Tung-Kuan Liu,et al.  Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic Algorithm , 2015, IEEE Access.

[18]  Yves Tabourier.  Problème d'ordonnancement à contraintes purement disjonctives , 1969 .

[19]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[20]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[21]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[22]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[23]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[24]  Nicola Beume,et al.  An EMO Algorithm Using the Hypervolume Measure as Selection Criterion , 2005, EMO.

[25]  Md. Fashiar Rahman,et al.  CHRONOLOGICAL EVOLUTION OF FLEXIBLE JOB SHOP SCHEDULING : A REVIEW , 2022 .

[26]  Tsung-Che Chiang,et al.  Flexible Job Shop Scheduling Using a Multiobjective Memetic Algorithm , 2011, ICIC.

[27]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[28]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[30]  Zhongqing Su,et al.  A Hybrid Particle Swarm Optimization (PSO)-Simplex Algorithm for Damage Identification of Delaminated Beams , 2012 .

[31]  Abid Ali Khan,et al.  A research survey: review of flexible job shop scheduling techniques , 2016, Int. Trans. Oper. Res..

[32]  Hua Xu,et al.  Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms , 2015, IEEE Transactions on Automation Science and Engineering.

[33]  Xinyu Li,et al.  Solving flexible job shop scheduling using an effective memetic algorithm , 2016, Int. J. Comput. Appl. Technol..

[34]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.