Optimal allocation of production resources is an urgent need for the development of industrialization. Reasonable production scheduling algorithm and excellent scheduling scheme can efficiently plan production resources, reduce production costs and shorten order completion time. Genetic algorithm has become one of the most popular algorithms for solving job shop scheduling problem because of its simplicity, versatility and good robustness. However, the genetic algorithm for solving NP-hard problems such as job shop scheduling has the problem of falling into local optimum, which leads to the decrease of solution accuracy. This study focused on the problem and proposed a generic enhanced search framework based on genetic algorithm, which named niche adaptive genetic algorithm. The niche selection mechanism and adaptive genetic operators were used to enrich the diversity of population, balance the genetic probability and enhance the global search performance of the algorithm. The working mechanism of this algorithm is analysed by testing data, and the proposed algorithm was tested on job-shop scheduling problem instances. The results show that the performance of the proposed method is 0.79 percentage points higher than that of the standard genetic algorithm, and it has the ability to search for the global optimum.
OzdagogluG., ErdemS. and SalumL., A special purpose multi-criteria heuristic function for a single machine scheduling problem with forward dynamic programming, International Journal of Advanced Manufacturing Technology68(5-8) (2013), 1875–1886.
2.
OzturkG., BahadirO. and TeymourifarA., Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming, International Journal of Production Research57(10) (2019), 3121–3137.
3.
WeiQ. and WuY., Dynamic programming algorithms for two-machine hybrid flow-shop scheduling with a given job sequence and deadline, IEEE Access8 (2020), 89964–89975.
4.
AlfieriA., ZhouS., ScatamacchiaR. and van de VeldeS.L., Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop, 4OR-A Quarterly Journal of Operations Research19(2) (2021), 265–288.
5.
FraminanJ.M., LeistenR. and RajendranC., Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flow shop sequencing problem, International Journal of Production Research41(1) (2010), 121–148.
6.
KalczynskiP.J. and KamburowskiJ., An improved NEH heuristic to minimize makespan in permutation flow shops, Computers & Operations Research35(9) (2008), 3001–3008.
7.
PanQ. and RuizR., A comprehensive review and evaluation of permutation flow shop heuristics to minimize flowtime, Computers & Operations Research40(1) (2013), 117–128.
8.
HollandJ.H., Adaptation in Natural and Artificial Systems, 1975.
9.
JK. and RE., ICNN95-International Conference on Neural Networks, 1995.
10.
DorigoM., CaroG.D. and GambardellaL.M., Ant algorithms for discrete optimization, Artificial Life5(2) (1999), 137–172.
11.
StornR. and PriceK., Differential evolution –a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization11(4) (1997), 341–359.
12.
ReevesC.R., A genetic algorithm for flow shop sequencing, Computers & Operations Research22(1) (1995), 5–13.
13.
CalişB. and BulkanS., A research survey: review of AI solution strategies of job shop scheduling problem, Journal of Intelligent Manufacturing26(5) (2015), 961–973.
14.
GaoK., CaoZ., ZhangL., ChenZ., HanY. and PanQ., A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems, IEEE/CAA Journal of Automatica Sinica6(4) (2019), 904–916.
15.
KatochS., ChauhanS.S. and KumarV., A review on genetic algorithm: past, present, and future, Multimedia Tools and Applications80(5) (2021), 8091–8126.
16.
SlowikA. and KwasnickaH., Evolutionary algorithms and their applications to engineering problems, Neural Computing and Applications32(16) (2020), 12363–12379.
17.
AlawadN.A. and Abed-alguniB.H., Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem, The Journal of Supercomputing78(3) (2022), 3517–3538.
18.
Abed-alguniB.H. and PaulD., Island-based cuckoo search with elite opposition-based learning and multiple mutation methods for solving discrete and continuous optimization problems, Soft Computing26(7) (2022), 3293–3312.
19.
WangJ. and WangL., A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling, Computers & Industrial Engineering168 (2022), 108126.
20.
PanZ., LeiD. and WangL., A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling, IEEE Transactions on Cybernetics52(6) (2022), 5051–5063.
21.
ZhaoF., ZhangL., CaoJ. and TangJ., A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem, Computers & Industrial Engineering153 (2021), 107082.
22.
ZhaoF., DiS. and WangL., A Hyperheuristic With Q-Learning for the Multiobjective Energy-Efficient Distributed Blocking Flow Shop Scheduling Problem, IEEE Transactions On Cybernetics (2022), 1–14.
23.
AzadehA., GoodarziA.H., KolaeeM.H. and JebreiliS., An efficient simulation-neural network-genetic algorithm for flexible flow shops with sequence-dependent setup times, job deterioration and learning effects, Neural Computing & Applications31(9SI) (2019), 5327–5341.
24.
DaiM., TangD., GiretA. and SalidoM.A., Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints, Robotics and Computer-Integrated Manufacturing59 (2019), 143–157.
25.
LiX. and GaoL., An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem, International Journal of Production Economics174 (2016), 93–110.
26.
YuanS., LiT. and WangB., A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times, Expert Systems with Applications152 (2020), 113360.
27.
ChenR., YangB., LiS. and WangS., A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem, Computers & Industrial Engineering149 (2020), 106778.
28.
DefershaF.M. and RooyaniD., An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached/detached setup, machine release date and lag-time, Computers & Industrial Engineering147 (2020), 106605.
29.
ZhangG., HuY., SunJ. and ZhangW., An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints, Swarm and Evolutionary Computation54 (2020), 100664.
30.
LuoQ., DengQ., GongG., ZhangL., HanW. and LiK., An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers, Expert Systems with Applications160 (2020), 113721.
31.
ShaoW., ShaoZ. and PiD., Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem, Knowledge-Based Systems194 (2020), 105527.
32.
ShaoW., ShaoZ. and PiD., Multi-local search-based general variable neighborhood search for distributed flow shop scheduling in heterogeneous multi-factories, Applied Soft Computing125 (2022), 109138.
33.
KeshanchiB., SouriA. and NavimipourN.J., An improved genetic algorithm for task scheduling in the cloud environments using the priority queues: Formal verification, simulation, and statistical testing, Journal of Systems and Software124 (2017), 1–21.
34.
XuY., LiK., HuJ. and LiK., A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues, Information Sciences270 (2014), 255–287.
35.
OreskiS. and OreskiG., Genetic algorithm-based heuristic for feature selection in credit risk assessment, Expert Systems with Applications41(4) (2014), 2052–2064.
36.
GuoK., YangM. and ZhuH., Application research of improved genetic algorithm based on machine learning in production scheduling, Neural Computing and Applications32(7) (2020), 1857–1868.
37.
MS. and MP.L., Adaptive probabilities of crossover and mutation in genetic algorithms, IEEE Transactions on Systems Man & Cybernetics24(4) (1994), 656–667.
38.
YanC., LiM., LiuW. and QiM., Improved adaptive genetic algorithm for the vehicle Insurance Fraud Identification Model based on a BP Neural Network, Theoretical Computer Science817 (2020), 12–23.
39.
YangC., QianQ., WangF. and SunM., IEEE 2016, pp.675–680.
