{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T15:04:44Z","timestamp":1774883084365,"version":"3.50.1"},"reference-count":66,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2025JJ60371"],"award-info":[{"award-number":["2025JJ60371"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2024JK2035"],"award-info":[{"award-number":["2024JK2035"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.cor.2026.107439","type":"journal-article","created":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T20:01:44Z","timestamp":1772308904000},"page":"107439","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A dual-population memetic algorithm for job shop scheduling problem considering sorting flexibility"],"prefix":"10.1016","volume":"191","author":[{"given":"Yang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Guiliang","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Xiahui","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhipeng","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Jinbo","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Ao","family":"He","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.cor.2026.107439_b0005","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.ejor.2023.07.042","article-title":"The robust cyclic job shop problem","volume":"312","author":"Hamaz","year":"2024","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107439_b0010","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1007\/s10845-021-01899-5","article-title":"Enhanced equilibrium optimizer algorithm applied in job shop scheduling problem","volume":"34","author":"Sun","year":"2023","journal-title":"J. Intell. Manuf."},{"issue":"6","key":"10.1016\/j.cor.2026.107439_b0015","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1007\/s10845-023-02161-w","article-title":"Smart scheduling of dynamic job shop based on discrete event simulation and deep reinforcement learning","volume":"35","author":"Wang","year":"2024","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107439_b0020","unstructured":"Ara\u00c3\u0113jo KA, Birgin EG, Ronconi DP. Models, constructive heuristics, and benchmark instances for the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect. arXiv preprint arXiv:240316766. 2024."},{"issue":"2","key":"10.1016\/j.cor.2026.107439_b0025","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.ejor.2004.04.020","article-title":"A heuristic to schedule flexible job-shop in a glass factory","volume":"165","author":"Alvarez-Vald\u00e9s","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107439_b0030","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/s001700200144","article-title":"Scheduling of flexible-sequenced process plans in a mould manufacturing shop","volume":"20","author":"Gan","year":"2002","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2026.107439_b0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122734","article-title":"An effective memetic algorithm for distributed flexible job shop scheduling problem considering integrated sequencing flexibility","volume":"242","author":"Tang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107439_b0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104207","article-title":"Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms","volume":"101","author":"Dehghan-Sanej","year":"2021","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.cor.2026.107439_b0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2023.102593","article-title":"Improved genetic algorithm based on multi-layer encoding approach for integrated process planning and scheduling problem","volume":"84","author":"Wen","year":"2023","journal-title":"Rob. Comput. Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107439_b0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105731","article-title":"A survey of job shop scheduling problem: the types and models","volume":"142","author":"Xiong","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107439_b0055","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107439_b0060","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1016\/j.ejor.2022.09.006","article-title":"A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources","volume":"306","author":"Fontes","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107439_b0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2022.102506","article-title":"A novel MILP model for job shop scheduling problem with mobile robots","volume":"81","author":"Yao","year":"2023","journal-title":"Rob. Comput. Integr. Manuf."},{"issue":"3","key":"10.1016\/j.cor.2026.107439_b0070","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1080\/00207543.2023.2175172","article-title":"Energy-efficient job shop scheduling problem with transport resources considering speed adjustable resources","volume":"62","author":"Fontes","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107439_b0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.107790","article-title":"A deep reinforcement learning model for dynamic job-shop scheduling problem with uncertain processing time","volume":"131","author":"Wu","year":"2024","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.cor.2026.107439_b0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.113792","article-title":"A tri-population evolutionary algorithm with adaptive stage-switching for complex CMOPs","author":"Chen","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107439_b0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120483","article-title":"MOFS-REPLS: a large-scale multi-objective feature selection algorithm based on real-valued encoding and preference leadership strategy","volume":"667","author":"Fu","year":"2024","journal-title":"Inf. Sci."},{"key":"10.1016\/j.cor.2026.107439_b0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101538","article-title":"A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV","volume":"86","author":"Han","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107439_b0095","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.07.011","article-title":"An effective memetic algorithm for multi-objective job-shop scheduling","volume":"182","author":"Gong","year":"2019","journal-title":"Knowl.-Based Syst."},{"issue":"12","key":"10.1016\/j.cor.2026.107439_b0100","doi-asserted-by":"crossref","first-page":"8519","DOI":"10.1109\/TII.2022.3165636","article-title":"Solving multiobjective fuzzy job-shop scheduling problem by a hybrid adaptive differential evolution algorithm","volume":"18","author":"Wang","year":"2022","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"1","key":"10.1016\/j.cor.2026.107439_b0105","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ejor.2020.04.017","article-title":"A meta-heuristic to solve the just-in-time job-shop scheduling problem","volume":"288","author":"Ahmadian","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107439_b0110","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.jmsy.2025.02.002","article-title":"A Q-learning-based improved multi-objective genetic algorithm for solving distributed heterogeneous assembly flexible job shop scheduling problems with transfers","volume":"79","author":"Yang","year":"2025","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107439_b0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108205","article-title":"A hybrid algorithm with a new neighborhood structure for job shop scheduling problems","volume":"169","author":"Xie","year":"2022","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"10.1016\/j.cor.2026.107439_b0120","doi-asserted-by":"crossref","first-page":"2147","DOI":"10.1080\/00207543.2022.2060772","article-title":"A new neighbourhood structure for job shop scheduling problems","volume":"61","author":"Xie","year":"2023","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107439_b0125","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2507\/IJSIMM13(4)CO20","article-title":"An improved genetic algorithm for job-shop scheduling problem with process sequence flexibility","volume":"13","author":"Huang","year":"2014","journal-title":"International Journal of Simulation Modelling."},{"issue":"10","key":"10.1016\/j.cor.2026.107439_b0130","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.1080\/00207543.2021.1912432","article-title":"A sequence learning harmony search algorithm for the flexible process planning problem","volume":"60","author":"Luo","year":"2022","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107439_b0135","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1080\/00207549608904961","article-title":"Modelling, measurement and evaluation of sequencing flexibility in manufacturing systems","volume":"34","author":"Benjaafar","year":"1996","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107439_b0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105053","article-title":"Integration of process planning and scheduling for distributed flexible job shops","volume":"124","author":"Lin","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107439_b0145","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TASE.2019.2945717","article-title":"A knowledge-based cuckoo search algorithm to schedule a flexible job shop with sequencing flexibility","volume":"18","author":"Cao","year":"2019","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"12","key":"10.1016\/j.cor.2026.107439_b0150","doi-asserted-by":"crossref","first-page":"3748","DOI":"10.1080\/00207543.2013.765074","article-title":"A priority scheduling approach for flexible job shops with multiple process plans","volume":"51","author":"Doh","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107439_b0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.107030","article-title":"A multi-population co-evolutionary algorithm for green integrated process planning and scheduling considering logistics system","volume":"126","author":"Liu","year":"2023","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.cor.2026.107439_b0160","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.jmsy.2023.07.004","article-title":"An improved genetic algorithm with modified critical path-based searching for integrated process planning and scheduling problem considering automated guided vehicle transportation task","volume":"70","author":"Liu","year":"2023","journal-title":"J. Manuf. Syst."},{"issue":"3","key":"10.1016\/j.cor.2026.107439_b0165","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/s10696-022-09446-x","article-title":"A multi-objective mathematical model and evolutionary algorithm for the dual-resource flexible job-shop scheduling problem with sequencing flexibility","volume":"35","author":"Vital-Soto","year":"2023","journal-title":"Flex. Serv. Manuf. J."},{"issue":"1","key":"10.1016\/j.cor.2026.107439_b0170","article-title":"Solving dual flexible job-shop scheduling problem using a Bat Algorithm","volume":"12","author":"Xu","year":"2017","journal-title":"Adv. Prod. Eng. Manage."},{"issue":"2","key":"10.1016\/j.cor.2026.107439_b0175","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.ejor.2015.06.023","article-title":"List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility","volume":"247","author":"Birgin","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107439_b0180","article-title":"A dynamic topological sort algorithm for directed acyclic graphs","volume":"11","author":"Pearce","year":"2007","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"10.1016\/j.cor.2026.107439_b0185","unstructured":"Zhang C, Cao Z, Wu Y, Song W, Sun J. Learning topological representations with bidirectional graph attention network for solving job shop scheduling problem. arXiv preprint arXiv:240217606. 2024."},{"issue":"19","key":"10.1016\/j.cor.2026.107439_b0190","doi-asserted-by":"crossref","first-page":"5748","DOI":"10.1080\/00207543.2014.910628","article-title":"A tabu search algorithm for simultaneous machine\/AGV scheduling problem","volume":"52","author":"Zheng","year":"2014","journal-title":"Int. J. Prod. Res."},{"issue":"16","key":"10.1016\/j.cor.2026.107439_b0195","doi-asserted-by":"crossref","first-page":"5402","DOI":"10.1080\/00207543.2017.1407884","article-title":"Efficient algorithm to find makespan in manufacturing systems under multiple scheduling perturbations","volume":"56","author":"Madraki","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107439_b0200","series-title":"2014 International Conference on Advances in Engineering & Technology Research (ICAETR-2014): IEEE","first-page":"1","article-title":"Parallel genetic algorithm for solving job-shop scheduling problem using topological sort","author":"Somani","year":"2014"},{"issue":"4","key":"10.1016\/j.cor.2026.107439_b0205","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1016\/j.cie.2007.06.018","article-title":"Integrated process planning and scheduling in a supply chain","volume":"54","author":"Moon","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107439_b0210","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109235","article-title":"A shuffled cellular evolutionary grey wolf optimizer for flexible job shop scheduling problem with tree-structure job precedence constraints","volume":"125","author":"Zhu","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107439_b0215","article-title":"Task Offloading in internet of Vehicles: a DRL-based Approach with Representation Learning for DAG Scheduling","author":"Deng","year":"2025","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.cor.2026.107439_b0220","article-title":"Research on flexible job-shop scheduling problem in green sustainable manufacturing based on learning effect","volume":"1\u201322","author":"Peng","year":"2022","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107439_b0225","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.jmsy.2023.08.021","article-title":"Multi-level modeling and robustness evaluation of disturbances in intelligent workshop with temporal snapshot network","volume":"71","author":"Zhou","year":"2023","journal-title":"J. Manuf. Syst."},{"issue":"5","key":"10.1016\/j.cor.2026.107439_b0230","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1109\/TSC.2023.3344481","article-title":"Efficient approximation algorithms for scheduling coflows with precedence constraints in identical parallel networks to minimize weighted completion time","volume":"17","author":"Chen","year":"2023","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107439_b0235","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s12293-022-00364-x","article-title":"A multiobjective memetic algorithm for integrated process planning and scheduling problem in distributed heterogeneous manufacturing systems","volume":"14","author":"Liu","year":"2022","journal-title":"Memet. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107439_b0240","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1080\/00207543.2021.2017057","article-title":"A theoretical framework to accelerate scheduling improvement heuristics using a new longest path algorithm in perturbed DAGs","volume":"61","author":"Madraki","year":"2023","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107439_b0245","doi-asserted-by":"crossref","first-page":"5986","DOI":"10.1016\/j.eswa.2010.11.022","article-title":"NNMA: an effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems","volume":"38","author":"Chiang","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107439_b0250","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101131","article-title":"A two-stage memetic algorithm for energy-efficient flexible job shop scheduling by means of decreasing the total number of machine restarts","volume":"75","author":"Gong","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107439_b0255","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1007\/s10845-019-01521-9","article-title":"A memetic algorithm for multi-objective distributed production scheduling: minimizing the makespan and total energy consumption","volume":"31","author":"Gong","year":"2020","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"10.1016\/j.cor.2026.107439_b0260","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TEVC.2022.3175832","article-title":"A learning-based memetic algorithm for energy-efficient flexible job-shop scheduling with type-2 fuzzy processing time","volume":"27","author":"Li","year":"2022","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107439_b0265","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117984","article-title":"A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm","volume":"207","author":"Luo","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.cor.2026.107439_b0270","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":"2013","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"3","key":"10.1016\/j.cor.2026.107439_b0275","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.3934\/jimo.2020010","article-title":"Integrated optimization of process planning and scheduling for reducing carbon emissions","volume":"17","author":"Liu","year":"2021","journal-title":"Journal of Industrial and Management Optimization."},{"key":"10.1016\/j.cor.2026.107439_b0280","series-title":"Classical and flexible job shop scheduling by tabu search","author":"Chambers","year":"1996"},{"issue":"2","key":"10.1016\/j.cor.2026.107439_b0285","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0377-2217(97)00341-X","article-title":"Multi-resource shop scheduling with resource flexibility","volume":"107","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107439_b0290","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job-shop scheduling problem with multi-purpose machines","volume":"15","author":"Hurink","year":"1994","journal-title":"Operations-Research-Spektrum"},{"issue":"2","key":"10.1016\/j.cor.2026.107439_b0295","doi-asserted-by":"crossref","first-page":"151","DOI":"10.7232\/iems.2013.12.2.151","article-title":"An efficient PSO algorithm for finding Pareto-frontier in multi-objective job shop scheduling problems","volume":"12","author":"Wisittipanich","year":"2013","journal-title":"Industrial Engineering and Management Systems."},{"key":"10.1016\/j.cor.2026.107439_b0300","doi-asserted-by":"crossref","unstructured":"Zhang F, Mei Y, Zhang M. Evolving dispatching rules for multi-objective dynamic flexible job shop scheduling via genetic programming hyper-heuristics. IEEE Congress on Evolutionary Computation (CEC): IEEE; 2019. p. 1366-73.","DOI":"10.1109\/CEC.2019.8790112"},{"issue":"4","key":"10.1016\/j.cor.2026.107439_b0305","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","article-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints","volume":"18","author":"Deb","year":"2013","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107439_b0310","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2023.101421","article-title":"Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility","volume":"84","author":"Gong","year":"2024","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107439_b0315","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"7","key":"10.1016\/j.cor.2026.107439_b0320","doi-asserted-by":"crossref","first-page":"2506","DOI":"10.1080\/00207543.2017.1388933","article-title":"A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility","volume":"56","author":"Gong","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107439_b0325","doi-asserted-by":"crossref","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 Syst. Appl."},{"issue":"2","key":"10.1016\/j.cor.2026.107439_b0330","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000572?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000572?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T14:30:31Z","timestamp":1774881031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":66,"alternative-id":["S0305054826000572"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107439","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A dual-population memetic algorithm for job shop scheduling problem considering sorting flexibility","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107439","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107439"}}