{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:48:57Z","timestamp":1777704537522,"version":"3.51.4"},"reference-count":35,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2023,10,4]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3233\/jifs-230076","type":"journal-article","created":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T15:07:21Z","timestamp":1691939241000},"page":"7095-7111","source":"Crossref","is-referenced-by-count":3,"title":["A generic enhanced search framework based on genetic algorithm: Case study on job shop scheduling problem"],"prefix":"10.1177","volume":"45","author":[{"given":"Zhongyuan","family":"Liang","sequence":"first","affiliation":[{"name":"Advanced Manufacturing Technology Center, Shandong University of Science and Technology, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peisi","family":"Zhong","sequence":"additional","affiliation":[{"name":"Advanced Manufacturing Technology Center, Shandong University of Science and Technology, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electronic Engineering, Shandong University of Science and Technology, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Advanced Manufacturing Technology Center, Shandong University of Science and Technology, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"5-8","key":"10.3233\/JIFS-230076_ref1","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1007\/s00170-013-4984-z","article-title":"A special purpose multi-criteria heuristic function for a single machine scheduling problem with forward dynamic programming","volume":"68","author":"Ozdagoglu","year":"2013","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"10","key":"10.3233\/JIFS-230076_ref2","doi-asserted-by":"crossref","first-page":"3121","DOI":"10.1080\/00207543.2018.1543964","article-title":"Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming","volume":"57","author":"Ozturk","year":"2019","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-230076_ref3","doi-asserted-by":"crossref","first-page":"89964","DOI":"10.1109\/ACCESS.2020.2993857","article-title":"Dynamic programming algorithms for two-machine hybrid flow-shop scheduling with a given job sequence and deadline","volume":"8","author":"Wei","year":"2020","journal-title":"IEEE Access"},{"issue":"2","key":"10.3233\/JIFS-230076_ref4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10288-020-00449-8","article-title":"Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop","volume":"19","author":"Alfieri","year":"2021","journal-title":"4OR-A Quarterly Journal of Operations Research"},{"issue":"1","key":"10.3233\/JIFS-230076_ref5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/00207540210161650","article-title":"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","volume":"41","author":"Framinan","year":"2010","journal-title":"International Journal of Production Research"},{"issue":"9","key":"10.3233\/JIFS-230076_ref6","doi-asserted-by":"crossref","first-page":"3001","DOI":"10.1016\/j.cor.2007.01.020","article-title":"An improved NEH heuristic to minimize makespan in permutation flow shops","volume":"35","author":"Kalczynski","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.3233\/JIFS-230076_ref7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2012.05.018","article-title":"A comprehensive review and evaluation of permutation flow shop heuristics to minimize flowtime","volume":"40","author":"Pan","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.3233\/JIFS-230076_ref10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Artificial Life"},{"issue":"4","key":"10.3233\/JIFS-230076_ref11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution \u2013a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"10.3233\/JIFS-230076_ref12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flow shop sequencing","volume":"22","author":"Reeves","year":"1995","journal-title":"Computers & Operations Research"},{"issue":"5","key":"10.3233\/JIFS-230076_ref13","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","article-title":"A research survey: review of AI solution strategies of job shop scheduling problem","volume":"26","author":"Cali\u015f","year":"2015","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"10.3233\/JIFS-230076_ref14","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","article-title":"A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems","volume":"6","author":"Gao","year":"2019","journal-title":"IEEE\/CAA Journal of Automatica Sinica"},{"issue":"5","key":"10.3233\/JIFS-230076_ref15","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A review on genetic algorithm: past, present, and future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimedia Tools and Applications"},{"issue":"16","key":"10.3233\/JIFS-230076_ref16","doi-asserted-by":"crossref","first-page":"12363","DOI":"10.1007\/s00521-020-04832-8","article-title":"Evolutionary algorithms and their applications to engineering problems","volume":"32","author":"Slowik","year":"2020","journal-title":"Neural Computing and Applications"},{"issue":"3","key":"10.3233\/JIFS-230076_ref17","doi-asserted-by":"crossref","first-page":"3517","DOI":"10.1007\/s11227-021-03998-9","article-title":"Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem","volume":"78","author":"Alawad","year":"2022","journal-title":"The Journal of Supercomputing"},{"issue":"7","key":"10.3233\/JIFS-230076_ref18","doi-asserted-by":"crossref","first-page":"3293","DOI":"10.1007\/s00500-021-06665-6","article-title":"Island-based cuckoo search with elite opposition-based learning and multiple mutation methods for solving discrete and continuous optimization problems","volume":"26","author":"Abed-alguni","year":"2022","journal-title":"Soft Computing"},{"key":"10.3233\/JIFS-230076_ref19","doi-asserted-by":"crossref","first-page":"108126","DOI":"10.1016\/j.cie.2022.108126","article-title":"A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling","volume":"168","author":"Wang","year":"2022","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"10.3233\/JIFS-230076_ref20","doi-asserted-by":"crossref","first-page":"5051","DOI":"10.1109\/TCYB.2020.3026571","article-title":"A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling","volume":"52","author":"Pan","year":"2022","journal-title":"IEEE Transactions on Cybernetics"},{"key":"10.3233\/JIFS-230076_ref21","doi-asserted-by":"crossref","first-page":"107082","DOI":"10.1016\/j.cie.2020.107082","article-title":"A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem","volume":"153","author":"Zhao","year":"2021","journal-title":"Computers & Industrial Engineering"},{"issue":"9SI","key":"10.3233\/JIFS-230076_ref23","doi-asserted-by":"crossref","first-page":"5327","DOI":"10.1007\/s00521-018-3368-6","article-title":"An efficient simulation-neural network-genetic algorithm for flexible flow shops with sequence-dependent setup times, job deterioration and learning effects","volume":"31","author":"Azadeh","year":"2019","journal-title":"Neural Computing & Applications"},{"key":"10.3233\/JIFS-230076_ref24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","article-title":"Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints","volume":"59","author":"Dai","year":"2019","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"10.3233\/JIFS-230076_ref25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","author":"Li","year":"2016","journal-title":"International Journal of Production Economics"},{"key":"10.3233\/JIFS-230076_ref26","doi-asserted-by":"crossref","first-page":"113360","DOI":"10.1016\/j.eswa.2020.113360","article-title":"A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times","volume":"152","author":"Yuan","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-230076_ref27","doi-asserted-by":"crossref","first-page":"106778","DOI":"10.1016\/j.cie.2020.106778","article-title":"A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem","volume":"149","author":"Chen","year":"2020","journal-title":"Computers & Industrial Engineering"},{"key":"10.3233\/JIFS-230076_ref28","doi-asserted-by":"crossref","first-page":"106605","DOI":"10.1016\/j.cie.2020.106605","article-title":"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","volume":"147","author":"Defersha","year":"2020","journal-title":"Computers & Industrial Engineering"},{"key":"10.3233\/JIFS-230076_ref29","doi-asserted-by":"crossref","first-page":"100664","DOI":"10.1016\/j.swevo.2020.100664","article-title":"An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints","volume":"54","author":"Zhang","year":"2020","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.3233\/JIFS-230076_ref30","doi-asserted-by":"crossref","first-page":"113721","DOI":"10.1016\/j.eswa.2020.113721","article-title":"An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers","volume":"160","author":"Luo","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-230076_ref31","doi-asserted-by":"crossref","first-page":"105527","DOI":"10.1016\/j.knosys.2020.105527","article-title":"Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem","volume":"194","author":"Shao","year":"2020","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/JIFS-230076_ref32","doi-asserted-by":"crossref","first-page":"109138","DOI":"10.1016\/j.asoc.2022.109138","article-title":"Multi-local search-based general variable neighborhood search for distributed flow shop scheduling in heterogeneous multi-factories","volume":"125","author":"Shao","year":"2022","journal-title":"Applied Soft Computing"},{"key":"10.3233\/JIFS-230076_ref33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jss.2016.07.006","article-title":"An improved genetic algorithm for task scheduling in the cloud environments using the priority queues: Formal verification, simulation, and statistical testing","volume":"124","author":"Keshanchi","year":"2017","journal-title":"Journal of Systems and Software"},{"key":"10.3233\/JIFS-230076_ref34","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ins.2014.02.122","article-title":"A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues","volume":"270","author":"Xu","year":"2014","journal-title":"Information Sciences"},{"issue":"4","key":"10.3233\/JIFS-230076_ref35","doi-asserted-by":"crossref","first-page":"2052","DOI":"10.1016\/j.eswa.2013.09.004","article-title":"Genetic algorithm-based heuristic for feature selection in credit risk assessment","volume":"41","author":"Oreski","year":"2014","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"10.3233\/JIFS-230076_ref36","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1007\/s00521-019-04571-5","article-title":"Application research of improved genetic algorithm based on machine learning in production scheduling","volume":"32","author":"Guo","year":"2020","journal-title":"Neural Computing and Applications"},{"issue":"4","key":"10.3233\/JIFS-230076_ref37","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","article-title":"Adaptive probabilities of crossover and mutation in genetic algorithms","volume":"24","author":"M","year":"1994","journal-title":"IEEE Transactions on Systems Man & Cybernetics"},{"key":"10.3233\/JIFS-230076_ref38","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.tcs.2019.06.025","article-title":"Improved adaptive genetic algorithm for the vehicle Insurance Fraud Identification Model based on a BP Neural Network","volume":"817","author":"Yan","year":"2020","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-230076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:26Z","timestamp":1777455686000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-230076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,4]]},"references-count":35,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/jifs-230076","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,4]]}}}