{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:06:44Z","timestamp":1778825204279,"version":"3.51.4"},"reference-count":36,"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\/501100004912","name":"Sichuan University","doi-asserted-by":"publisher","award":["ZYYC21004"],"award-info":[{"award-number":["ZYYC21004"]}],"id":[{"id":"10.13039\/501100004912","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013290","name":"National Key Research and Development Program of China Stem Cell and Translational Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013290","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2026ZD0555600"],"award-info":[{"award-number":["2026ZD0555600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2026ZD0555601"],"award-info":[{"award-number":["2026ZD0555601"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.asoc.2026.115230","type":"journal-article","created":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T15:46:56Z","timestamp":1776354416000},"page":"115230","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A hybrid adaptive large neighborhood search with sample average approximation for elective and clinically urgent surgery scheduling under uncertainty"],"prefix":"10.1016","volume":"198","author":[{"given":"Li","family":"Lu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4922-676X","authenticated-orcid":false,"given":"Qu","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Xie","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0930-5325","authenticated-orcid":false,"given":"Chu","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Cui","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8136-9816","authenticated-orcid":false,"given":"Kang","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.asoc.2026.115230_bib0005","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1111\/poms.13949","article-title":"Feature-driven robust surgery scheduling","volume":"32","author":"Wang","year":"2023","journal-title":"Prod. Oper. Manag.","ISSN":"https:\/\/id.crossref.org\/issn\/1059-1478","issn-type":"print"},{"issue":"1","key":"10.1016\/j.asoc.2026.115230_bib0010","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2024.07.036","article-title":"Surgery scheduling in flexible operating rooms by using a convex surrogate model of second-stage costs","volume":"321","author":"Majthoub Almoghrabi","year":"2025","journal-title":"Eur. J. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-2217","issn-type":"print"},{"issue":"1\u20132","key":"10.1016\/j.asoc.2026.115230_bib0015","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ijpe.2004.12.006","article-title":"Operating rooms scheduling","volume":"99","author":"Jebali","year":"2006","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"10.1016\/j.asoc.2026.115230_bib0020","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.dss.2012.10.019","article-title":"Multi-objective operating room scheduling considering desiderata of the surgical team","volume":"55","author":"Meskens","year":"2013","journal-title":"Decis. Support Syst."},{"issue":"8","key":"10.1016\/j.asoc.2026.115230_bib0025","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115230_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207543.2025.2513575","article-title":"Nesting and scheduling for parallel additive manufacturing machines with uncertain processing times: a simulation-optimisation approach","author":"Wu","year":"2025","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2026.115230_bib0035","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ijpe.2014.07.015","article-title":"A column-generation-based heuristic algorithm for solving operating theater planning problem under stochastic demand and surgery cancellation risk","volume":"158","author":"Wang","year":"2014","journal-title":"Int. J. Prod. Econ.","ISSN":"https:\/\/id.crossref.org\/issn\/0925-5273","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.imu.2023.101180","article-title":"Adapting duration categorical value to accommodate duration variability in a next-day operating room scheduling","volume":"37","author":"Yuniartha","year":"2023","journal-title":"Inform. Med. Unlocked","ISSN":"https:\/\/id.crossref.org\/issn\/2352-9148","issn-type":"print"},{"issue":"3","key":"10.1016\/j.asoc.2026.115230_bib0045","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1016\/j.ejor.2017.12.025","article-title":"Optimal distribution of operating hours over operating rooms using probabilities","volume":"267","author":"Koppka","year":"2018","journal-title":"Eur. J. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-2217","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2019.01.002","article-title":"Mitigating overtime risk in tactical surgical scheduling","volume":"93","author":"Zhang","year":"2020","journal-title":"Omega","ISSN":"https:\/\/id.crossref.org\/issn\/0305-0483","issn-type":"print"},{"issue":"4","key":"10.1016\/j.asoc.2026.115230_bib0055","first-page":"1551","article-title":"Logic-based benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling","volume":"33","author":"Guo","year":"2021","journal-title":"Inf. J. Comput."},{"issue":"6","key":"10.1016\/j.asoc.2026.115230_bib0060","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1016\/j.cor.2009.09.016","article-title":"An elective surgery scheduling problem considering patient priority","volume":"37","author":"Min","year":"2010","journal-title":"Comput. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0305-0548","issn-type":"print"},{"issue":"3","key":"10.1016\/j.asoc.2026.115230_bib0065","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1287\/ijoc.2017.0745","article-title":"Collaborative operating room planning and scheduling","volume":"29","author":"Roshanaei","year":"2017","journal-title":"Info. J. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1091-9856","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0070","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.cor.2015.06.002","article-title":"Operating room scheduling with generalized disjunctive programming","volume":"64","author":"Castro","year":"2015","journal-title":"Comput. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0305-0548","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0075","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.cie.2015.10.002","article-title":"New heuristics for planning operating rooms","volume":"90","author":"Molina-Pariente","year":"2015","journal-title":"Comput. Ind. Eng.","ISSN":"https:\/\/id.crossref.org\/issn\/0360-8352","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0080","first-page":"1572","article-title":"Machine learning based integrated scheduling and rescheduling for elective and emergency patients in the operating theatre","author":"Eshghali","year":"2023","journal-title":"Ann. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0254-5330","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107551","article-title":"Scheduling elective and emergency surgeries at shared operating rooms with emergency uncertainty and waiting time limit","volume":"160","author":"Miao","year":"2021","journal-title":"Comput. Ind. Eng.","ISSN":"https:\/\/id.crossref.org\/issn\/0360-8352","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0090","article-title":"Elective surgery scheduling with surgeon-patient classification and two-sided matching","author":"Li","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115230_bib0095","article-title":"Random-key algorithms for optimizing integrated operating room scheduling","volume":"180","author":"Salezze Vieira","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115230_bib0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.127684","article-title":"A novel joint optimization of bed scheduling and patient re-allocation for hospital multiple departments based on homogeneous Markov chain","volume":"281","author":"Liu","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115230_bib0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107098","article-title":"Integrated robust scheduling for inpatient surgery and ambulatory surgery","author":"Dai","year":"2025","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115230_bib0110","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s10729-006-9005-4","article-title":"Optimization of surgery sequencing and scheduling decisions under uncertainty","volume":"10","author":"Denton","year":"2006","journal-title":"Health Care Manag. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/1572-9389","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0115","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.cie.2018.09.030","article-title":"Uncertainty in advance scheduling problem in operating room planning","volume":"126","author":"Kamran","year":"2018","journal-title":"Comput. Ind. Eng.","ISSN":"https:\/\/id.crossref.org\/issn\/0360-8352","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.dajour.2024.100544","article-title":"A bi-objective stochastic model for operating room scheduling considering surgeons\u2019 preferences and collaborative surgeries","volume":"14","author":"Azab","year":"2025","journal-title":"Decis. Anal. J.","ISSN":"https:\/\/id.crossref.org\/issn\/2772-6622","issn-type":"print"},{"issue":"3","key":"10.1016\/j.asoc.2026.115230_bib0125","doi-asserted-by":"crossref","first-page":"1430","DOI":"10.1287\/opre.2022.0258","article-title":"Stochastic optimization approaches for an operating room and anesthesiologist scheduling problem","volume":"73","author":"Tsang","year":"2025","journal-title":"Oper. Res."},{"key":"10.1016\/j.asoc.2026.115230_bib0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106136","article-title":"A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints","volume":"152","author":"Bargetto","year":"2023","journal-title":"Comput. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0305-0548","issn-type":"print"},{"issue":"10","key":"10.1016\/j.asoc.2026.115230_bib0135","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1016\/j.cor.2011.01.007","article-title":"Local search and lower bounds for the patient admission scheduling problem","volume":"38","author":"Ceschia","year":"2011","journal-title":"Comput. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0305-0548","issn-type":"print"},{"issue":"4","key":"10.1016\/j.asoc.2026.115230_bib0140","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10951-014-0407-8","article-title":"Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays","volume":"19","author":"Ceschia","year":"2016","journal-title":"J. Sched.","ISSN":"https:\/\/id.crossref.org\/issn\/1094-6136","issn-type":"print"},{"key":"10.1016\/j.asoc.2026.115230_bib0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.108233","article-title":"Collaborative scheduling of operating room in hospital network: multi-objective learning variable neighborhood search","volume":"116","author":"Lotfi","year":"2022","journal-title":"Appl. Soft Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1568-4946","issn-type":"print"},{"issue":"1\u20132","key":"10.1016\/j.asoc.2026.115230_bib0150","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10479-022-05094-4","article-title":"Scheduling operating rooms of multiple hospitals considering transportation and deterioration in mass-casualty incidents","volume":"321","author":"Zhu","year":"2023","journal-title":"Ann. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0254-5330","issn-type":"print"},{"issue":"3","key":"10.1016\/j.asoc.2026.115230_bib0155","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10951-019-00614-w","article-title":"Optimizing the physician scheduling problem in a large hospital ward","volume":"23","author":"Mansini","year":"2020","journal-title":"J. Sched.","ISSN":"https:\/\/id.crossref.org\/issn\/1094-6136","issn-type":"print"},{"issue":"2","key":"10.1016\/j.asoc.2026.115230_bib0160","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.ejor.2024.10.042","article-title":"A dedicated branch-price-and-cut algorithm for advance patient planning and surgeon scheduling","volume":"322","author":"Akbarzadeh","year":"2025","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115230_bib0165","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.111096","article-title":"A stochastic optimization model and decomposition techniques for surgery scheduling with duration and emergency demand uncertainty","volume":"204","author":"Gong","year":"2025","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115230_bib0170","article-title":"A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem","volume":"168","author":"Akpunar","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115230_bib0175","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104562","article-title":"A hybrid large neighborhood search algorithm for the integrated dial-a-ride problem using electric vehicles","volume":"206","author":"Fang","year":"2026","journal-title":"Transp. Res. E Logist. Transp. Rev."},{"key":"10.1016\/j.asoc.2026.115230_bib0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.112323","article-title":"A two-phase adaptive large neighborhood search algorithm for the electric location routing problem with range anxiety","volume":"167","author":"Zhang","year":"2024","journal-title":"Appl. Soft Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1568-4946","issn-type":"print"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626006782?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626006782?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:07:47Z","timestamp":1778821667000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626006782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":36,"alternative-id":["S1568494626006782"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115230","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A hybrid adaptive large neighborhood search with sample average approximation for elective and clinically urgent surgery scheduling under uncertainty","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115230","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115230"}}