{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T16:08:43Z","timestamp":1784218123374,"version":"3.55.0"},"reference-count":93,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T00:00:00Z","timestamp":1780099200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.asoc.2026.115602","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T16:03:31Z","timestamp":1780329811000},"page":"115602","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PB","title":["Revisiting the evolution of genetic algorithms in scheduling"],"prefix":"10.1016","volume":"201","author":[{"given":"Kuo-Ching","family":"Ying","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1207-3587","authenticated-orcid":false,"given":"Pourya","family":"Pourhejazy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai-Yueh","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2026.115602_bib1","first-page":"1","article-title":"Integrated scheduling of multi-objective lot-streaming hybrid flowshop with AGV based on deep reinforcement learning","author":"Tang","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib2","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1007\/s12065-023-00822-6","article-title":"Genetic algorithms: theory, genetic operators, solutions, and applications","volume":"17","author":"Alhijawi","year":"2024","journal-title":"Evol. Intell."},{"key":"10.1016\/j.asoc.2026.115602_bib3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0360-8352(90)90082-W","article-title":"Genetic algorithms and job shop scheduling","volume":"19","author":"Biegel","year":"1990","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/9270802","article-title":"Recent research trends in genetic algorithm based flexible job shop scheduling problems","volume":"2018","author":"Amjad","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib5","first-page":"2593","article-title":"A didactic review on genetic algorithms for industrial planning and scheduling problems*","volume":"55","author":"Neumann","year":"2022","journal-title":"IFAC-Pap."},{"key":"10.1016\/j.asoc.2026.115602_bib6","doi-asserted-by":"crossref","first-page":"2888","DOI":"10.1080\/00207543.2023.2237122","article-title":"Genetic algorithms for planning and scheduling engineer-to-order production: a systematic review","volume":"62","author":"Neumann","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0202009","article-title":"Genetic algorithms and the optimal allocation of trials","volume":"2","author":"Holland","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib8","series-title":"in: Annals of Discrete Mathematics","first-page":"287","article-title":"Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey","author":"Graham","year":"1979"},{"key":"10.1016\/j.asoc.2026.115602_bib9","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106709","article-title":"Revisiting the development trajectory of parallel machine scheduling","volume":"168","author":"Ying","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s11192-019-03034-x","article-title":"A few notes on main path analysis","volume":"119","author":"Liu","year":"2019","journal-title":"Scientometrics"},{"key":"10.1016\/j.asoc.2026.115602_bib11","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.asoc.2026.115602_bib12","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s11192-009-0146-3","article-title":"Software survey: VOSviewer, a computer program for bibliometric mapping","volume":"84","author":"van Eck","year":"2010","journal-title":"Scientometrics"},{"key":"10.1016\/j.asoc.2026.115602_bib13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","article-title":"Evolution based learning in a job shop scheduling environment","volume":"22","author":"Dorndorf","year":"1995","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib14","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1080\/095372899232597","article-title":"A simulated annealing algorithm for job shop scheduling","volume":"10","author":"Ponnambalam","year":"1999","journal-title":"Prod. Plan. & Control."},{"key":"10.1016\/j.asoc.2026.115602_bib15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/s001700200126","article-title":"A Modified Genetic Algorithm for Job Shop Scheduling","volume":"20","author":"Wang","year":"2002","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib16","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1007\/s00170-004-2283-4","article-title":"Improved genetic algorithm for the job-shop scheduling problem","volume":"27","author":"Liu","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib17","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s00170-006-0652-x","article-title":"Research on immune genetic algorithm for solving the job-shop scheduling problem","volume":"34","author":"Xu","year":"2007","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib18","doi-asserted-by":"crossref","first-page":"6814","DOI":"10.1016\/j.eswa.2010.12.064","article-title":"Non-identical parallel machine scheduling using genetic algorithm","volume":"38","author":"Balin","year":"2011","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115602_bib19","doi-asserted-by":"crossref","first-page":"9248","DOI":"10.1016\/j.eswa.2011.01.136","article-title":"An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem","volume":"38","author":"Liu","year":"2011","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115602_bib20","doi-asserted-by":"crossref","first-page":"10016","DOI":"10.1016\/j.eswa.2012.01.211","article-title":"Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm","volume":"39","author":"Chen","year":"2012","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115602_bib21","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1007\/s12206-015-0242-7","article-title":"A new genetic algorithm for flexible job-shop scheduling problems","volume":"29","author":"Driss","year":"2015","journal-title":"J. Mech. Sci. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib22","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":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2026.115602_bib23","first-page":"1","article-title":"A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling","volume":"2017","author":"Deng","year":"2017","journal-title":"Comput. Intell. Neurosci."},{"key":"10.1016\/j.asoc.2026.115602_bib24","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.jclepro.2017.10.188","article-title":"A new double flexible job-shop scheduling problem integrating processing time, green production, and human factor indicators","volume":"174","author":"Gong","year":"2018","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.asoc.2026.115602_bib25","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.jclepro.2018.03.254","article-title":"A two-stage optimization method for energy-saving flexible job-shop scheduling based on energy dynamic characterization","volume":"188","author":"Wang","year":"2018","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.asoc.2026.115602_bib26","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":"Robot. Comput. Integr. Manuf."},{"key":"10.1016\/j.asoc.2026.115602_bib27","doi-asserted-by":"crossref","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 Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib28","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2021.102198","article-title":"Research on flexible job shop scheduling under finite transportation conditions for digital twin workshop","volume":"72","author":"Yan","year":"2021","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"10.1016\/j.asoc.2026.115602_bib29","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119359","article-title":"Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system","volume":"215","author":"Sun","year":"2023","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115602_bib30","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2023.137307","article-title":"Integrated carbon footprint with cutting parameters for production scheduling","volume":"412","author":"He","year":"2023","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.asoc.2026.115602_bib31","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","article-title":"An effective hybrid optimization strategy for job-shop scheduling problems","volume":"28","author":"Wang","year":"2001","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib32","doi-asserted-by":"crossref","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":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib33","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s10845-011-0520-x","article-title":"A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study","volume":"23","author":"Meeran","year":"2012","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.asoc.2026.115602_bib34","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1080\/095372899232768","article-title":"Hybrid approach to decision-making for job-shop scheduling","volume":"10","author":"Mesghouni","year":"1999","journal-title":"Prod. Plan. & Control."},{"key":"10.1016\/j.asoc.2026.115602_bib35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","article-title":"Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems","volume":"32","author":"Kacem","year":"2002","journal-title":"IEEE Trans. Syst. Man. Cybern. Part. C. (Appl. Rev."},{"key":"10.1016\/j.asoc.2026.115602_bib36","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ijpe.2012.03.034","article-title":"A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling","volume":"141","author":"Chiang","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2026.115602_bib37","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.ejor.2007.06.039","article-title":"A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem","volume":"190","author":"Vilcot","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib38","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","article-title":"Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms","volume":"12","author":"Yuan","year":"2015","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib39","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1007\/s12597-019-00395-y","article-title":"Evolutionary algorithms for multi-objective dual-resource constrained flexible job-shop scheduling problem","volume":"56","author":"Yazdani","year":"2019","journal-title":"OPSEARCH"},{"key":"10.1016\/j.asoc.2026.115602_bib40","doi-asserted-by":"crossref","first-page":"104864","DOI":"10.1109\/ACCESS.2021.3096007","article-title":"A Hybrid Genetic Algorithm for Flexible Job Shop Scheduling Problem With Sequence-Dependent Setup Times and Job Lag Times","volume":"9","author":"Wang","year":"2021","journal-title":"IEEE Access."},{"key":"10.1016\/j.asoc.2026.115602_bib41","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","article-title":"Genetic algorithms for the two-stage bicriteria flowshop problem","volume":"95","author":"Neppalli","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib42","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.asoc.2007.06.005","article-title":"Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems","volume":"8","author":"Chang","year":"2008","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib43","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1016\/j.eswa.2007.11.050","article-title":"A hybrid electromagnetism-like algorithm for single machine scheduling problem","volume":"36","author":"Chang","year":"2009","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115602_bib44","doi-asserted-by":"crossref","first-page":"11057","DOI":"10.1016\/j.eswa.2009.02.080","article-title":"A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic","volume":"36","author":"Behnamian","year":"2009","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115602_bib45","doi-asserted-by":"crossref","first-page":"7609","DOI":"10.1016\/j.eswa.2010.12.101","article-title":"Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach","volume":"38","author":"Khademi Zare","year":"2011","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115602_bib46","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/S0305-0548(98)00090-2","article-title":"Parallel machine scheduling with earliness and tardiness penalties","volume":"26","author":"Sivrikaya-\u015eerifo\u01e7lu","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib47","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.eswa.2005.04.033","article-title":"Two-phase sub population genetic algorithm for parallel machine-scheduling problem","volume":"29","author":"CHANG","year":"2005","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115602_bib48","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00170-013-4749-8","article-title":"Optimization of production scheduling with time-dependent and machine-dependent electricity cost for industrial energy efficiency","volume":"68","author":"Moon","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib49","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cie.2007.04.010","article-title":"A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems","volume":"53","author":"Gao","year":"2007","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib50","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10845-008-0150-0","article-title":"Integrating simulation and genetic algorithm to schedule a dynamic flexible job shop","volume":"20","author":"Gholami","year":"2009","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.asoc.2026.115602_bib51","doi-asserted-by":"crossref","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","article-title":"Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption","volume":"112","author":"Zhang","year":"2016","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.asoc.2026.115602_bib52","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.3934\/mbe.2019065","article-title":"Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm","volume":"16","author":"Zhang","year":"2019","journal-title":"Math. Biosci. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib53","doi-asserted-by":"crossref","first-page":"11561","DOI":"10.1007\/s10586-017-1420-4","article-title":"A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem","volume":"22","author":"Zhang","year":"2019","journal-title":"Clust. Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib54","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the Flexible Job-shop Scheduling Problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib55","doi-asserted-by":"crossref","first-page":"2995","DOI":"10.1080\/00207540902814348","article-title":"A genetic algorithm for flexible job shop scheduling with fuzzy processing time","volume":"48","author":"Lei","year":"2010","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib56","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1016\/j.asoc.2012.03.025","article-title":"Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling","volume":"12","author":"Lei","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib57","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cor.2014.08.023","article-title":"Genetic tabu search for the fuzzy flexible job shop problem","volume":"54","author":"Palacios","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib58","first-page":"111","article-title":"An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times","volume":"180","author":"Zandieh","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib59","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1080\/18756891.2008.9727611","article-title":"An application of effective genetic algorithms for Solving Hybrid Flow Shop Scheduling Problems","volume":"1","author":"Kahraman","year":"2008","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"10.1016\/j.asoc.2026.115602_bib60","doi-asserted-by":"crossref","first-page":"3056","DOI":"10.1016\/j.asoc.2010.12.006","article-title":"An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems","volume":"11","author":"Engin","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib61","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.cie.2013.01.004","article-title":"A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem","volume":"64","author":"Costa","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib62","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s00170-011-3807-3","article-title":"A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks","volume":"62","author":"Singh","year":"2012","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib63","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.cie.2016.05.006","article-title":"Hybrid genetic algorithm and tabu search for finite capacity material requirement planning system in flexible flow shop with assembly operations","volume":"97","author":"Sukkerd","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib64","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1177\/0037549718809542","article-title":"Stochastic flexible flow shop scheduling problem with limited buffers and fixed interval preventive maintenance: a hybrid approach of simulation and metaheuristic algorithms","volume":"95","author":"Rooeinfar","year":"2019","journal-title":"Simulation"},{"key":"10.1016\/j.asoc.2026.115602_bib65","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104503","article-title":"An effective hybrid meta-heuristic for flexible flow shop scheduling with limited buffers and step-deteriorating jobs","volume":"106","author":"Zheng","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115602_bib66","first-page":"13","article-title":"Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times","author":"Mousavi","year":"2023","journal-title":"Manag. Prod. Eng. Rev."},{"key":"10.1016\/j.asoc.2026.115602_bib67","article-title":"Surgery scheduling in outpatient procedure centre with re-entrant patient flow and fuzzy service times","volume":"102","author":"Wang","year":"2021","journal-title":"Omega (West. )"},{"key":"10.1016\/j.asoc.2026.115602_bib68","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109755","article-title":"An adaptive-learning-based genetic algorithm for collaborative scheduling of distributed operating rooms","volume":"131","author":"Wang","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib69","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0954-1810(99)00021-7","article-title":"A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines","volume":"13","author":"Min","year":"1999","journal-title":"Artif. Intell. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib70","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.rcim.2004.12.005","article-title":"Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness\/tardiness scheduling problems","volume":"22","author":"Min","year":"2006","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"10.1016\/j.asoc.2026.115602_bib71","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1007\/s00170-006-0553-z","article-title":"Workflow balancing in parallel machines through genetic algorithm","volume":"33","author":"Rajakumar","year":"2007","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib72","doi-asserted-by":"crossref","first-page":"2799","DOI":"10.1007\/s00170-013-5221-5","article-title":"A hybrid genetic algorithm for job sequencing and worker allocation in parallel unrelated machines with sequence-dependent setup times","volume":"69","author":"Costa","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib73","doi-asserted-by":"crossref","first-page":"5841","DOI":"10.1080\/00207543.2014.920966","article-title":"Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times","volume":"52","author":"Yilmaz Eroglu","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib74","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cie.2016.05.020","article-title":"Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions","volume":"98","author":"Afzalirad","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib75","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2019.119428","article-title":"Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization","volume":"249","author":"Soleimani","year":"2020","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.asoc.2026.115602_bib76","doi-asserted-by":"crossref","first-page":"9277","DOI":"10.3390\/su13169277","article-title":"Green Scheduling of Identical Parallel Machines with Release Date, Delivery Time and No-Idle Machine Constraints","volume":"13","author":"Hidri","year":"2021","journal-title":"Sustainability"},{"key":"10.1016\/j.asoc.2026.115602_bib77","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cor.2018.02.017","article-title":"Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities","volume":"95","author":"Woo","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib78","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/j.ejor.2020.09.050","article-title":"A matheuristic for parallel machine scheduling with tool replacements","volume":"291","author":"Dang","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib79","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106361","article-title":"Unsupervised parallel machines scheduling with tool switches","volume":"160","author":"Dang","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib80","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.cie.2015.04.006","article-title":"A local search genetic algorithm for the job shop scheduling problem with intelligent agents","volume":"85","author":"Asadzadeh","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib81","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.cie.2015.07.015","article-title":"A new hybrid island model genetic algorithm for job shop scheduling problem","volume":"88","author":"Kurdi","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib82","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.cor.2015.10.005","article-title":"An effective new island model genetic algorithm for job shop scheduling problem","volume":"67","author":"Kurdi","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib83","doi-asserted-by":"crossref","first-page":"4561","DOI":"10.3390\/s22124561","article-title":"A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem","volume":"22","author":"Viana","year":"2022","journal-title":"Sensors"},{"key":"10.1016\/j.asoc.2026.115602_bib84","first-page":"461","article-title":"Two new robust genetic algorithms for the flowshop scheduling problem","volume":"34","author":"Ruiz","year":"2006","journal-title":"Omega (West. )"},{"key":"10.1016\/j.asoc.2026.115602_bib85","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/j.ejor.2008.04.033","article-title":"Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization","volume":"196","author":"Zhang","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib86","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ijpe.2012.06.007","article-title":"A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem","volume":"141","author":"Chang","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2026.115602_bib87","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.cie.2015.02.009","article-title":"A linkage mining in block-based evolutionary algorithm for permutation flowshop scheduling problem","volume":"83","author":"Hsu","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib88","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1016\/j.cor.2011.08.016","article-title":"A Self-guided Genetic Algorithm for permutation flowshop scheduling problems","volume":"39","author":"Chen","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115602_bib89","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.cie.2011.11.002","article-title":"Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems","volume":"62","author":"Chen","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115602_bib90","doi-asserted-by":"crossref","first-page":"2459","DOI":"10.1007\/s00170-015-8052-8","article-title":"An immunity-based hybrid genetic algorithms for permutation flowshop scheduling problems","volume":"85","author":"Bessedik","year":"2016","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115602_bib91","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106458","article-title":"A memetic algorithm with novel semi-constructive evolution operators for permutation flowshop scheduling problem","volume":"94","author":"Kurdi","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115602_bib92","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":"J. Supercomput."},{"key":"10.1016\/j.asoc.2026.115602_bib93","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.jbusres.2021.04.070","article-title":"\"How to conduct a bibliometric analysis: an overview and guidelines","volume":"133","author":"Donthu","year":"2021","journal-title":"J. Bus. Res."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626010501?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626010501?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:55:18Z","timestamp":1784217318000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626010501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":93,"alternative-id":["S1568494626010501"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115602","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Revisiting the evolution of genetic algorithms in scheduling","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115602","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115602"}}