A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem

The Flexible Job Shop Scheduling Problem (FJSP) is a combinatorial problem that continues to be studied extensively due to its practical implications in manufacturing systems and emerging new variants, in order to model and optimize more complex situations that reflect the current needs of the industry better. This work presents a new metaheuristic algorithm called the global-local neighborhood search algorithm (GLNSA), in which the neighborhood concepts of a cellular automaton are used, so that a set of leading solutions called smart-cells generates and shares information that helps to optimize instances of the FJSP. The GLNSA algorithm is accompanied by a tabu search that implements a simplified version of the Nopt1 neighborhood defined in Mastrolilli & Gambardella (2000) to complement the optimization task. The experiments carried out show a satisfactory performance of the proposed algorithm, compared with other results published in recent algorithms, using four benchmark sets and 101 test problems.

[1]  Wei Liu,et al.  A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling , 2017, Comput. Intell. Neurosci..

[2]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[3]  Xiaohui Song,et al.  A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem , 2018, Cluster Computing.

[4]  Xiabao Huang,et al.  A hybrid genetic algorithm for multi-objective flexible job shop scheduling problem considering transportation time , 2019, Int. J. Intell. Comput. Cybern..

[5]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[6]  Imed Eddine Bennour,et al.  A two-level particle swarm optimization algorithm for the flexible job shop scheduling problem , 2019, Swarm Intelligence.

[7]  P. Alam.  ‘G’ , 2021, Composites Engineering: An A–Z Guide.

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

[9]  Siba Sankar Mahapatra,et al.  An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method , 2018, Journal of Industrial Engineering International.

[10]  Jia Yang,et al.  Improved Whale Algorithm for Solving the Flexible Job Shop Scheduling Problem , 2019, Mathematics.

[11]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[12]  Stephen Wolfram.  One-dimensional Cellular Automata , .

[13]  Kejia Zhuang,et al.  Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems , 2017, Comput. Ind. Eng..

[14]  Norberto Hernandez-Romero,et al.  A new design method for adaptive IIR system identification using hybrid CPSO and DE , 2017 .

[15]  Xinyu Li,et al.  An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem , 2016 .

[16]  Wei Long,et al.  Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems , 2020, PloS one.

[17]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[18]  Quan-Ke Pan,et al.  An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems , 2010, Comput. Ind. Eng..

[19]  Mitsuo Gen,et al.  A Bayesian Optimization-based Evolutionary Algorithm for Flexible Job Shop Scheduling , 2015, Complex Adaptive Systems.

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

[21]  Camino R. Vela,et al.  Scatter search with path relinking for the flexible job shop scheduling problem , 2015, Eur. J. Oper. Res..

[22]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[23]  A. Toshev.  Particle Swarm Optimization and Tabu Search Hybrid Algorithm for Flexible Job Shop Scheduling Problem – Analysis of Test Results , 2019, Cybernetics and Information Technologies.

[24]  Liang Gao,et al.  Cellular particle swarm optimization , 2011, Inf. Sci..

[25]  Mostafa Zandieh,et al.  A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms , 2016, Comput. Oper. Res..

[26]  Manuel Laguna,et al.  Tabu Search , 1997 .

[27]  Lei Zhu,et al.  A hybrid multi-verse optimization for the fuzzy flexible job-shop scheduling problem , 2019, Comput. Ind. Eng..

[28]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[29]  Ch. Ratnam,et al.  An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem , 2018 .

[30]  M. Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities , 2014 .

[31]  Harold V. McIntosh.  One Dimensional Cellular Automata , 2009 .

[32]  A. Gnanavelbabu,et al.  Solving the flexible job shop scheduling problem using an improved Jaya algorithm , 2019, Comput. Ind. Eng..

[33]  Stéphane Dauzère-Pérès,et al.  Solving the flexible job shop scheduling problem with sequence-dependent setup times , 2018, Eur. J. Oper. Res..

[34]  Ji Zhang,et al.  An improved non-dominated sorting biogeography-based optimization algorithm for the (hybrid) multi-objective flexible job-shop scheduling problem , 2020, Appl. Soft Comput..

[35]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid , 1999 .

[36]  Ahmed Chiheb Ammari,et al.  An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem , 2015, Journal of Intelligent Manufacturing.

[37]  Ghorbanali Mohammadi,et al.  Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints , 2012, Comput. Math. Appl..

[38]  Shi Li,et al.  A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem , 2020, Comput. Ind. Eng..

[39]  Zhenghua Chen,et al.  A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems , 2019, IEEE/CAA Journal of Automatica Sinica.

[40]  Edilson R. R. Kato,et al.  A new approach to solve the flexible job shop problem based on a hybrid particle swarm optimization and Random-Restart Hill Climbing , 2018, Comput. Ind. Eng..

[41]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

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

[43]  Maoguo Gong,et al.  Adaptive multimeme algorithm for flexible job shop scheduling problem , 2016, Natural Computing.

[44]  Markus Olhofer,et al.  A tabu search-based memetic algorithm for the multi-objective flexible job shop scheduling problem , 2019, GECCO.

[45]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[46]  Juan Carlos Seck Tuoh Mora,et al.  The solution of the concurrent layout scheduling problem in the job-shop environment through a local neighborhood search algorithm , 2020, Expert Syst. Appl..

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

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

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

[50]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[51]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[52]  Sushma Jain,et al.  Hybrid frameworks for flexible job shop scheduling , 2020 .

[53]  Congbo Li,et al.  The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously , 2019, Comput. Ind. Eng..

[54]  Rong Chen,et al.  Flexible job-shop scheduling with tolerated time interval and limited starting time interval based on hybrid discrete PSO-SA: An application from a casting workshop , 2019, Appl. Soft Comput..

[55]  J. J. Wang,et al.  Flexible Job-Shop Scheduling Problem Based on Hybrid ACO Algorithm , 2017 .

[56]  Laurent Deroussi,et al.  New effective neighborhoods for the permutation flow shop problem , 2006 .

[57]  R. Hu,et al.  An elitist nondominated sorting hybrid algorithm for multi-objective flexible job-shop scheduling problem with sequence-dependent setups , 2019, Knowl. Based Syst..

[58]  Wei Liu,et al.  A new double flexible job-shop scheduling problem integrating processing time, green production, and human factor indicators , 2018 .

[59]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[60]  Mostafa Zandieh,et al.  A variable neighbourhood search algorithm for the flexible job-shop scheduling problem , 2010 .

[61]  Quan-Ke Pan,et al.  A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations , 2018, Int. J. Prod. Res..

[62]  Stepan Bilan,et al.  New Methods and Paradigms for Modeling Dynamic Processes Based on Cellular Automata , 2021 .

[63]  Adil Baykasoğlu,et al.  Greedy randomized adaptive search for dynamic flexible job-shop scheduling , 2020, Journal of Manufacturing Systems.

[64]  Jiadong Yang,et al.  A hybrid harmony search algorithm for the flexible job shop scheduling problem , 2013, Appl. Soft Comput..

[65]  Naiming Xie,et al.  Flexible job shop scheduling problem with interval grey processing time , 2018, Appl. Soft Comput..

[66]  Andrew Adamatzky,et al.  Game of Life Cellular Automata , 2010 .

[67]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[69]  Jorge Puente,et al.  Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling , 2020, Comput. Oper. Res..