{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:09:57Z","timestamp":1783058997984,"version":"3.54.6"},"reference-count":33,"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"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.engappai.2026.114766","type":"journal-article","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:33:51Z","timestamp":1775756031000},"page":"114766","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"P1","title":["A two-stage robust rescheduling for flexible job shop based on release time prediction using a Q-learning-based hyper-heuristic evolutionary algorithm"],"prefix":"10.1016","volume":"176","author":[{"given":"Wenyu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sihan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6544-3660","authenticated-orcid":false,"given":"Wanru","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyi","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yushu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"15","key":"10.1016\/j.engappai.2026.114766_bib1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.knosys.2019.02.010","article-title":"A hyper-heuristic for improving the initial population of whale optimization algorithm","volume":"172","author":"Abd Elaziz","year":"2019","journal-title":"Knowl. Base Syst."},{"key":"10.1016\/j.engappai.2026.114766_bib2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","article-title":"A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms","volume":"73","author":"Ahmadi","year":"2016","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.engappai.2026.114766_bib3","doi-asserted-by":"crossref","first-page":"3101","DOI":"10.1109\/TCYB.2022.3151855","article-title":"Multiobjective flexible job-shop rescheduling with new job insertion and machine preventive maintenance","volume":"53","author":"An","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.engappai.2026.114766_bib4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.jmsy.2020.06.005","article-title":"Greedy randomized adaptive search for dynamic flexible job-shop scheduling","volume":"56","author":"Baykaso\u011flu","year":"2020","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.engappai.2026.114766_bib5","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106863","article-title":"An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption","volume":"149","author":"Caldeira","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.engappai.2026.114766_bib6","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.cie.2014.08.012","article-title":"An integrated job release and scheduling approach on parallel machines: an application in electric wire-harness industry","volume":"76","author":"Cevikcan","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.engappai.2026.114766_bib7","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101658","article-title":"A Q-Learning based NSGA-II for dynamic flexible job shop scheduling with limited transportation resources","volume":"90","author":"Chen","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.engappai.2026.114766_bib8","article-title":"A genetic programming based cooperative evolutionary algorithm for flexible job shop with crane transportation and setup times","volume":"169","author":"Chen","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.engappai.2026.114766_bib9","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100985","article-title":"Multi-objective Q-learning-based hyper-heuristic with Bi-criteria selection for energy-aware mixed shop scheduling","volume":"69","author":"Cheng","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.engappai.2026.114766_bib10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jmsy.2023.01.004","article-title":"Flexible job shop scheduling problem under industry 5.0: a survey on human reintegration, environmental consideration and resilience improvement","volume":"67","author":"Destouet","year":"2023","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.engappai.2026.114766_bib11","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.109488","article-title":"Diverse policy generation for the flexible job-shop scheduling problem via deep reinforcement learning with a novel graph representation","volume":"139","author":"Echeverria","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.114766_bib12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.jmsy.2024.03.002","article-title":"Flexible job shop scheduling with stochastic machine breakdowns by an improved tuna swarm optimization algorithm","volume":"74","author":"Fan","year":"2024","journal-title":"J. Manuf. Syst."},{"issue":"3","key":"10.1016\/j.engappai.2026.114766_bib13","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":"2023","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.engappai.2026.114766_bib14","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104284","article-title":"Q-learning and hyper-heuristic based algorithm recommendation for changing environments","volume":"102","author":"G\u00f6lc\u00fck","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.engappai.2026.114766_bib15","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/TCYB.2017.2771213","article-title":"Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns","volume":"49","author":"Han","year":"2017","journal-title":"IEEE Trans. Cybern."},{"issue":"16","key":"10.1016\/j.engappai.2026.114766_bib16","doi-asserted-by":"crossref","first-page":"4999","DOI":"10.1080\/00207543.2010.495088","article-title":"Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns","volume":"49","author":"Hasan","year":"2011","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.engappai.2026.114766_bib17","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1109\/TCYB.2021.3112675","article-title":"Q-learning-based hyperheuristic evolutionary algorithm for dynamic task allocation of crowdsensing","volume":"53","author":"Ji","year":"2021","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.engappai.2026.114766_bib18","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.jmsy.2024.01.011","article-title":"Joint scheduling optimisation method for the machining and heat-treatment of hydraulic cylinders based on improved multi-objective migrating birds optimisation","volume":"73","author":"Li","year":"2024","journal-title":"J. Manuf. Syst."},{"issue":"13","key":"10.1016\/j.engappai.2026.114766_bib19","doi-asserted-by":"crossref","first-page":"4049","DOI":"10.1080\/00207543.2022.2058432","article-title":"Deep reinforcement learning for dynamic scheduling of a flexible job shop","volume":"60","author":"Liu","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.engappai.2026.114766_bib20","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108487","article-title":"A double deep q-network framework for a flexible job shop scheduling problem with dynamic job arrivals and urgent job insertions","volume":"133","author":"Lu","year":"2024","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.114766_bib21","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106208","article-title":"Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning","volume":"91","author":"Luo","year":"2020","journal-title":"Appl. Soft Comput."},{"issue":"19","key":"10.1016\/j.engappai.2026.114766_bib22","doi-asserted-by":"crossref","first-page":"5790","DOI":"10.1080\/00207543.2020.1790686","article-title":"Reactive scheduling approach for solving a realistic flexible job shop scheduling problem","volume":"59","author":"Mihoubi","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.engappai.2026.114766_bib23","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s10845-012-0626-9","article-title":"A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates","volume":"24","author":"Nie","year":"2013","journal-title":"J. Intell. Manuf."},{"issue":"5","key":"10.1016\/j.engappai.2026.114766_bib24","doi-asserted-by":"crossref","first-page":"2281","DOI":"10.1007\/s10845-022-01922-3","article-title":"Digital twin-driven dynamic scheduling of a hybrid flow shop","volume":"34","author":"Tliba","year":"2023","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.engappai.2026.114766_bib25","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2022.102435","article-title":"Edge computing-based real-time scheduling for digital twin flexible job shop with variable time window","volume":"79","author":"Wang","year":"2023","journal-title":"Robot. Comput. Integrated Manuf."},{"key":"10.1016\/j.engappai.2026.114766_bib26","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122752","article-title":"Comparison study of dispatching rules and heuristics for online scheduling of single machine scheduling problem with predicted release time jobs","volume":"243","author":"Xiong","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.engappai.2026.114766_bib27","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.ijpe.2012.04.015","article-title":"Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns","volume":"141","author":"Xiong","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.engappai.2026.114766_bib28","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110628","article-title":"Solving the multi-robot task allocation with functional tasks based on a hyper-heuristic algorithm","volume":"146","author":"Yan","year":"2023","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.engappai.2026.114766_bib29","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1109\/TASE.2023.3246223","article-title":"A review of robust machine scheduling","volume":"21","author":"Zhang","year":"2023","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.engappai.2026.114766_bib30","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105267","article-title":"A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context","volume":"132","author":"Zhang","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.engappai.2026.114766_bib31","doi-asserted-by":"crossref","first-page":"3414","DOI":"10.1109\/TSMC.2022.3225443","article-title":"Scenario-based robust remanufacturing scheduling problem using improved biogeography-based optimization algorithm","volume":"53","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Syst. Man Cybern.: Systems"},{"key":"10.1016\/j.engappai.2026.114766_bib32","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110695","article-title":"Q-learning-based hyper-heuristic evolutionary algorithm for the distributed assembly blocking flowshop scheduling problem","volume":"146","author":"Zhang","year":"2023","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"10.1016\/j.engappai.2026.114766_bib33","doi-asserted-by":"crossref","first-page":"3337","DOI":"10.1109\/TCYB.2022.3192112","article-title":"A hyperheuristic with Q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem","volume":"53","author":"Zhao","year":"2022","journal-title":"IEEE Trans. Cybern."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626010481?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626010481?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:14:40Z","timestamp":1778562880000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197626010481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":33,"alternative-id":["S0952197626010481"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2026.114766","relation":{},"ISSN":["0952-1976"],"issn-type":[{"value":"0952-1976","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A two-stage robust rescheduling for flexible job shop based on release time prediction using a Q-learning-based hyper-heuristic evolutionary algorithm","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2026.114766","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":"114766"}}