{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T08:17:53Z","timestamp":1783671473617,"version":"3.55.0"},"reference-count":50,"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,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"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":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.asoc.2026.115483","type":"journal-article","created":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T06:58:00Z","timestamp":1779173880000},"page":"115483","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["A hybrid NSGA-III and Q-learning algorithm for multi-mode and multi-objective resource constrained project scheduling considering two-layered stochastic inputs"],"prefix":"10.1016","volume":"201","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5070-6891","authenticated-orcid":false,"given":"Huiping","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2266-6868","authenticated-orcid":false,"given":"Guangyuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Runqi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bright","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingguang","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siyong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guizhen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongtao","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1624-5806","authenticated-orcid":false,"given":"Dun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9666-4025","authenticated-orcid":false,"given":"Sai","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2026.115483_bib1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.ejor.2013.10.012","article-title":"An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances","volume":"235","author":"Van Peteghem","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib2","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110333","article-title":"A matheuristic-oriented iterated greedy algorithm for multi-mode resource-constrained project scheduling problem under uncertainty","volume":"193","author":"Gao","year":"2024","journal-title":"Comput. & Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib3","doi-asserted-by":"crossref","DOI":"10.1016\/j.jenvman.2024.121986","article-title":"Preemptive and non-preemptive multi-skill multi-mode resource-constrained project scheduling problems considering sustainability and energy consumption: A comprehensive mathematical model","volume":"367","author":"Shahabi-Shahmiri","year":"2024","journal-title":"J. Environ. Manag."},{"key":"10.1016\/j.asoc.2026.115483_bib4","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.126103","article-title":"Multiple surrogates-assisted evolutionary algorithm for high-dimensional expensive multi-objective optimization with adaptive diffusion map","volume":"266","author":"Yan","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115483_bib5","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.111201","article-title":"Bi-objective multi-mode resource-constrained multi-project scheduling using combined NSGA II and Q-learning algorithm","volume":"152","author":"Yang","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115483_bib6","doi-asserted-by":"crossref","DOI":"10.1016\/j.neunet.2024.106898","article-title":"Multi-compartment neuron and population encoding powered spiking neural network for deep distributional reinforcement learning","volume":"182","author":"Sun","year":"2025","journal-title":"Neural Netw."},{"key":"10.1016\/j.asoc.2026.115483_bib7","doi-asserted-by":"crossref","unstructured":"G. Speranza, Hierarchical models for multi-project planning and scheduling, (n.d.). https:\/\/doi.org\/10.1016\/0377-2217(93)90185-P.","DOI":"10.1016\/0377-2217(93)90185-P"},{"key":"10.1016\/j.asoc.2026.115483_bib8","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","article-title":"Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case","volume":"28","author":"Talbot","year":"1982","journal-title":"Manag. Sci."},{"key":"10.1016\/j.asoc.2026.115483_bib9","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108201","article-title":"A comparative study of modeling and solution approaches for the multi-mode resource-constrained discrete time\u2013cost trade-off problem: Case study of an ERP implementation project","volume":"169","author":"\u00c7ak\u0131r","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib10","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122002","article-title":"Robustifying the resource-constrained project scheduling against uncertain durations","volume":"238","author":"Fu","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115483_bib11","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.106726","article-title":"An integrated chance-constrained stochastic model for a preemptive multi-skilled multi-mode resource-constrained project scheduling problem: A case study of building a sports center","volume":"126","author":"Mirnezami","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115483_bib12","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109741","article-title":"A hybrid metaheuristic algorithm for resource-constrained proactive project scheduling with uncertainty-handling effort","volume":"186","author":"Cui","year":"2023","journal-title":"Comput. & Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","article-title":"Fuzzy sets","volume":"8","author":"Zadeh","year":"1965","journal-title":"Inf. Control"},{"key":"10.1016\/j.asoc.2026.115483_bib14","first-page":"141","article-title":"Decision-making in a fuzzy environment","author":"Bellman","year":"1970","journal-title":"Manag. Sci. 17"},{"key":"10.1016\/j.asoc.2026.115483_bib15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2010.07.021","article-title":"A heuristic method for RCPSP with fuzzy activity times","volume":"208","author":"Bhaskar","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib16","doi-asserted-by":"crossref","DOI":"10.1016\/j.techfore.2021.121137","article-title":"A new approach for material ordering and multi-mode resource constraint project scheduling problem in a multi-site context under interval-valued fuzzy uncertainty","volume":"173","author":"Patoghi","year":"2021","journal-title":"Technol. Forecast. Soc. Change"},{"key":"10.1016\/j.asoc.2026.115483_bib17","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115207","article-title":"A novel mathematical programming model for multi-mode project portfolio selection and scheduling with flexible resources and due dates under interval-valued fuzzy random uncertainty","volume":"182","author":"Zolfaghari","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115483_bib18","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108402","article-title":"Credibility-based chance-constrained multimode resource-constrained project scheduling problem under fuzzy uncertainty","volume":"171","author":"Liu","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib19","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.autcon.2018.11.029","article-title":"Fuzzy resource-constrained project scheduling with multiple routes: A heuristic solution","volume":"100","author":"Birjandi","year":"2019","journal-title":"Autom. Constr."},{"key":"10.1016\/j.asoc.2026.115483_bib20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2009.09.019","article-title":"A double genetic algorithm for the MRCPSP\/max","volume":"38","author":"Barrios","year":"2011","journal-title":"Comput. & Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib21","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2019.09.052","article-title":"A robust optimization approach for the multi-mode resource-constrained project scheduling problem","volume":"291","author":"Balouka","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib22","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2024.109427","article-title":"Efficient optimization of robust project scheduling for industry 4.0: A hybrid approach based on machine learning and meta-heuristic algorithms","volume":"278","author":"Goli","year":"2024","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2026.115483_bib23","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.ejor.2023.07.035","article-title":"Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration","volume":"312","author":"Portoleau","year":"2024","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib24","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120623","article-title":"A bi-objective optimization for finance-based and resource-constrained robust project scheduling","volume":"231","author":"Liu","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115483_bib25","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119188","article-title":"Critical chain based proactive-reactive scheduling for resource-constrained project scheduling under uncertainty","volume":"214","author":"Peng","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115483_bib26","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.ejor.2021.01.011","article-title":"Underground mine scheduling under uncertainty","volume":"294","author":"Nesbitt","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib27","first-page":"71","article-title":"An uncertain model for RCPSP with solution robustness focusing on logistics project schedule","volume":"3","author":"Ke","year":"2015","journal-title":"Int. J. E-Navig. Marit. Econ."},{"key":"10.1016\/j.asoc.2026.115483_bib28","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105104","article-title":"An evolutionary approach for resource constrained project scheduling with uncertain changes","volume":"125","author":"Zaman","year":"2021","journal-title":"Comput. & Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib29","first-page":"369","article-title":"Managing and modelling general resource transfers in (multi-)project scheduling","volume":"32","author":"Kr\u00fcger","year":"2010","journal-title":"Spectrum"},{"key":"10.1016\/j.asoc.2026.115483_bib30","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/j.ejor.2008.07.036","article-title":"A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times","volume":"197","author":"Kr\u00fcger","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib31","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108754","article-title":"A genetic algorithm for proactive project scheduling with resource transfer times","volume":"174","author":"Ma","year":"2022","journal-title":"Comput. & Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib32","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1016\/j.ejor.2022.05.014","article-title":"A tree search heuristic for the resource constrained project scheduling problem with transfer times","volume":"304","author":"Liu","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib33","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106445","article-title":"Project scheduling cost optimization based on resource transfer costs and robustness","volume":"161","author":"Zhang","year":"2024","journal-title":"Comput. & Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib34","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106097","article-title":"A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times","volume":"151","author":"Liu","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib35","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101678","article-title":"Co-evolution genetic programming-based hyper-heuristics for the stochastic project scheduling problem with resource transfer and idle costs","volume":"90","author":"Zhang","year":"2024","journal-title":"Swarm Evolut. Comput."},{"key":"10.1016\/j.asoc.2026.115483_bib36","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120430","article-title":"A heuristic solution framework for the resource-constrained multi-aircraft scheduling problem with transfer of resources and aircraft","volume":"228","author":"Su","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115483_bib37","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106816","article-title":"Surrogate-assisted cooperative learning genetic programming for the resource-constrained project scheduling problem with stochastic activity durations and transfer times","volume":"173","author":"Zhang","year":"2025","journal-title":"Comput. & Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib38","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107363","article-title":"Scheduling project with stochastic durations and time-varying resource requests: A metaheuristic approach","volume":"157","author":"Rahman","year":"2021","journal-title":"Comput. & Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib39","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2022.101751","article-title":"Multi-objective optimization of shield construction parameters based on random forests and NSGA-II","volume":"54","author":"Wu","year":"2022","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.asoc.2026.115483_bib40","doi-asserted-by":"crossref","DOI":"10.1016\/j.est.2024.113362","article-title":"Optimized scheduling of integrated community energy stations based on improved NSGA-III algorithm","volume":"99","author":"Fang","year":"2024","journal-title":"J. Energy Storage"},{"key":"10.1016\/j.asoc.2026.115483_bib41","first-page":"269","article-title":"Modeling and multi-objective optimization of time, greenhouse gas emissions, and resources for sustainable construction projects","volume":"39","author":"Hussain","year":"2023","journal-title":"Sustain. Prod. Consum."},{"key":"10.1016\/j.asoc.2026.115483_bib42","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cie.2017.01.029","article-title":"Multi-objective algorithms to multi-mode resource-constrained projects under mode change disruption","volume":"106","author":"Elloumi","year":"2017","journal-title":"Comput. & Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib43","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.compchemeng.2016.02.018","article-title":"A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem","volume":"88","author":"Maghsoudlou","year":"2016","journal-title":"Comput. & Chem. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107316","article-title":"Multi-objective multi-mode resource-constrained project scheduling with fuzzy activity durations in prefabricated building construction","volume":"158","author":"Yuan","year":"2021","journal-title":"Comput. & Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115483_bib45","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105533","article-title":"Multi-mode resource constrained project scheduling and contractor selection: Mathematical formulation and metaheuristic algorithms","volume":"81","author":"Nemati-Lafmejani","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115483_bib46","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.ejor.2006.10.061","article-title":"Proactive heuristic procedures for robust project scheduling: An experimental analysis","volume":"189","author":"Van De Vonder","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib47","doi-asserted-by":"crossref","first-page":"3839","DOI":"10.1080\/00207543.2019.1636319","article-title":"The integration of resource allocation and time buffering for bi-objective robust project scheduling","volume":"58","author":"Liang","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib48","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints: Classification and complexity","volume":"5","author":"Blazewicz","year":"1983","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.asoc.2026.115483_bib49","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSPLIB - a project scheduling problem library","volume":"96","author":"Kolisch","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115483_bib50","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1007\/s13198-020-01020-8","article-title":"A bi-objective model for redundancy allocation problem in designing server farms: Mathematical formulation and solution approaches","volume":"11","author":"Baradaran","year":"2020","journal-title":"Int. J. Syst. Assur Eng. Manag"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626009312?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626009312?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T07:52:43Z","timestamp":1783669963000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626009312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":50,"alternative-id":["S1568494626009312"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115483","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":"A hybrid NSGA-III and Q-learning algorithm for multi-mode and multi-objective resource constrained project scheduling considering two-layered stochastic inputs","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115483","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115483"}}