A Local Search-Based Generalized Normal Distribution Algorithm for Permutation Flow Shop Scheduling

This paper studies the generalized normal distribution algorithm (GNDO) performance for tackling the permutation flow shop scheduling problem (PFSSP). Because PFSSP is a discrete problem and GNDO generates continuous values, the largest ranked value rule is used to convert those continuous values into discrete ones to make GNDO applicable for solving this discrete problem. Additionally, the discrete GNDO is effectively integrated with a local search strategy to improve the quality of the best-so-far solution in an abbreviated version of HGNDO. More than that, a new improvement using the swap mutation operator applied on the best-so-far solution to avoid being stuck into local optima by accelerating the convergence speed is effectively applied to HGNDO to propose a new version, namely a hybrid-improved GNDO (HIGNDO). Last but not least, the local search strategy is improved using the scramble mutation operator to utilize each trial as ideally as possible for reaching better outcomes. This improved local search strategy is integrated with IGNDO to produce a new strong algorithm abbreviated as IHGNDO. Those proposed algorithms are extensively compared with a number of well-established optimization algorithms using various statistical analyses to estimate the optimal makespan for 41 well-known instances in a reasonable time. The findings show the benefits and speedup of both IHGNDO and HIGNDO over all the compared algorithms, in addition to HGNDO.

[1]  Yuan Yan Tang,et al.  Hyperspectral image classification using wavelet transform-based smooth ordering , 2019, Int. J. Wavelets Multiresolution Inf. Process..

[2]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Ruey-Maw Chen,et al.  Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search , 2013, Algorithms.

[4]  A. L. Sangal,et al.  Tunicate Swarm Algorithm: A new bio-inspired based metaheuristic paradigm for global optimization , 2020, Eng. Appl. Artif. Intell..

[5]  Xinyu Shao,et al.  An effective hybrid teaching-learning-based optimization algorithm for permutation flow shop scheduling problem , 2014, Adv. Eng. Softw..

[6]  Mohamed Abdel-Basset,et al.  A Simple and Effective Approach for Tackling the Permutation Flow Shop Scheduling Problem , 2021, Mathematics.

[7]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[8]  MengChu Zhou,et al.  Comprehensive Learning Particle Swarm Optimization Algorithm With Local Search for Multimodal Functions , 2019, IEEE Transactions on Evolutionary Computation.

[9]  Wenfeng Li,et al.  A discrete multi-objective fireworks algorithm for flowshop scheduling with sequence-dependent setup times , 2019, Swarm Evol. Comput..

[10]  Yan Li,et al.  Enhancing Whale Optimization Algorithm with Chaotic Theory for Permutation Flow Shop Scheduling Problem , 2021, Int. J. Comput. Intell. Syst..

[11]  Lu Xiong,et al.  Color disease spot image segmentation algorithm based on chaotic particle swarm optimization and FCM , 2020, J. Supercomput..

[12]  Enrique Alba,et al.  An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem , 2020, Inf. Sci..

[13]  Xiangtao Li,et al.  An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure , 2013, Adv. Eng. Softw..

[14]  Yuan Yan Tang,et al.  A Framework of Adaptive Multiscale Wavelet Decomposition for Signals on Undirected Graphs , 2019, IEEE Transactions on Signal Processing.

[15]  Fan T. Tseng,et al.  New MILP models for the permutation flowshop problem , 2008, J. Oper. Res. Soc..

[16]  Heming Jia,et al.  Dynamic Harris Hawks Optimization with Mutation Mechanism for Satellite Image Segmentation , 2019, Remote. Sens..

[17]  Osman Gokalp,et al.  A novel wrapper feature selection algorithm based on iterated greedy metaheuristic for sentiment classification , 2020, Expert Syst. Appl..

[18]  Emanuel Guariglia,et al.  Harmonic Sierpinski Gasket and Applications , 2018, Entropy.

[19]  Zhigang Jin,et al.  Generalized normal distribution optimization and its applications in parameter extraction of photovoltaic models , 2020 .

[20]  Aseem K. Mishra,et al.  A discrete Jaya algorithm for permutation flow-shop scheduling problem , 2020, International Journal of Industrial Engineering Computations.

[21]  Mohamed Abdel-Basset,et al.  A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem , 2018, Future Gener. Comput. Syst..

[22]  Ya Li,et al.  A novel discrete whale optimization algorithm for solving knapsack problems , 2020, Applied Intelligence.

[23]  Seyedali Mirjalili,et al.  SCA: A Sine Cosine Algorithm for solving optimization problems , 2016, Knowl. Based Syst..

[24]  Emanuel Guariglia,et al.  Entropy and Fractal Antennas , 2016, Entropy.

[25]  Chandrasekharan Rajendran,et al.  Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives , 2011 .

[26]  Hossam Faris,et al.  Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems , 2017, Adv. Eng. Softw..

[27]  Xing Zhang,et al.  Wind farm micro-siting by Gaussian particle swarm optimization with local search strategy , 2012 .

[28]  M. Sayadi,et al.  A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems , 2010 .

[29]  Mohammad Masoud Javidi,et al.  A hybrid search method of wrapper feature selection by chaos particle swarm optimization and local search , 2016 .

[30]  Minghao Yin,et al.  A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem , 2013 .

[31]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

[32]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

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

[34]  Lingfeng Wang,et al.  Reserve-constrained multiarea environmental/economic dispatch based on particle swarm optimization with local search , 2009, Eng. Appl. Artif. Intell..

[35]  Ritu Garg,et al.  HIGA: Harmony-inspired genetic algorithm for rack-aware energy-efficient task scheduling in cloud data centers , 2020 .

[36]  Seyedali Mirjalili,et al.  Equilibrium optimizer: A novel optimization algorithm , 2020, Knowl. Based Syst..

[37]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[38]  Yan-Feng Liu,et al.  A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem , 2013, Appl. Soft Comput..

[39]  Ahmed A. Zaki Diab,et al.  Coyote Optimization Algorithm for Parameters Estimation of Various Models of Solar Cells and PV Modules , 2020, IEEE Access.

[40]  Octavia A. Dobre,et al.  Task Scheduling for Mobile Edge Computing Using Genetic Algorithm and Conflict Graphs , 2020, IEEE Transactions on Vehicular Technology.