{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:32:52Z","timestamp":1762324372593,"version":"3.37.3"},"reference-count":52,"publisher":"EDP Sciences","issue":"5","license":[{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201604490106"],"award-info":[{"award-number":["201604490106"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,11,25]]},"published-print":{"date-parts":[[2019,11]]},"abstract":"<jats:p>This paper addresses an operating room planning problem with surgical demands from both the elective patients and the non-elective ones. A dynamic waiting list is established to prioritize and manage the patients according to their urgency levels and waiting times. In every decision period, sequential decisions are taken by selecting high-priority patients from the waiting list to be scheduled. With consideration of random arrivals of new patients and uncertain surgery durations, the studied problem is formulated as a novel Markov decision process model with dead ends. The objective is to optimize a combinatorial cost function involving patient waiting times and operating room over-utilizations. Considering that the conventional dynamic programming algorithms have difficulties in coping with large-scale problems, we apply several adapted real-time dynamic programming algorithms to solve the proposed model. In numerical experiments, we firstly apply different algorithms to solve the same instance and compare the computational efficiencies. Then, to evaluate the effects of dead ends on the policy and the computation, we conduct simulations for multiple instances with the same problem scale but different dead ends. Experimental results indicate that incorporating dead ends into the model helps to significantly shorten the patient waiting times and improve the computational efficiency.<\/jats:p>","DOI":"10.1051\/ro\/2018110","type":"journal-article","created":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T19:56:32Z","timestamp":1543348592000},"page":"1819-1841","source":"Crossref","is-referenced-by-count":4,"title":["A Markov decision model with dead ends for operating room planning considering dynamic patient priority"],"prefix":"10.1051","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0555-3467","authenticated-orcid":false,"given":"Jian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahjoub","family":"Dridi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdellah","family":"El Moudni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,10,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1109\/TASE.2012.2225047","volume":"11","author":"Sperandio","year":"2014","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"R2","doi-asserted-by":"crossref","first-page":"2913","DOI":"10.1007\/s00500-014-1453-z","volume":"19","author":"Wang","year":"2015","journal-title":"Soft Comput."},{"key":"R3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.cor.2014.08.014","volume":"54","author":"Aringhieri","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.orhc.2015.05.005","volume":"7","author":"Van Riet","year":"2015","journal-title":"Oper. Res. Health Care"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Zhu S., Fan W., Yang S., Pei J. and Pardalos P.M., Operating room planning and surgical case scheduling: a review of literature. J. Comb. Optim. 1\u201349 (2018).","DOI":"10.1007\/s10878-018-0322-6"},{"key":"R6","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1016\/j.cor.2009.09.016","volume":"37","author":"Min","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/s10696-015-9213-7","volume":"28","author":"Addis","year":"2016","journal-title":"Flexible Serv. Manuf. J."},{"key":"R8","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10951-016-0489-6","volume":"19","author":"Samudra","year":"2016","journal-title":"J. Scheduling"},{"key":"R9","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1016\/j.ejor.2006.02.057","volume":"185","author":"Lamiri","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Ferrand Y., Magazine M. and Rao U., Comparing two operating-room-allocation policies for elective and emergency surgeries. In: Proceedings of the 2010 Winter Simulation Conference. IEEE (2010) 2364\u20132374.","DOI":"10.1109\/WSC.2010.5678933"},{"key":"R11","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.ejor.2009.04.011","volume":"201","author":"Cardoen","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10729-010-9143-6","volume":"14","author":"Guerriero","year":"2011","journal-title":"Health Care Manage. Sci."},{"key":"R13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1051\/ro\/2013047","volume":"48","author":"Min","year":"2014","journal-title":"RAIRO: OR"},{"key":"R14","doi-asserted-by":"crossref","first-page":"1584","DOI":"10.1287\/mnsc.2014.2067","volume":"61","author":"Truong","year":"2015","journal-title":"Manage. Sci."},{"key":"R15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.cie.2014.11.021","volume":"80","author":"Saadouli","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"R16","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.ejor.2017.01.036","volume":"261","author":"Marques","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2017.06.051","volume":"264","author":"Burdett","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"R18","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.cie.2016.05.016","volume":"97","author":"Latorre-N\u00fa\u00f1ez","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"R19","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/s10916-015-0385-1","volume":"40","author":"Heydari","year":"2016","journal-title":"J. Med. Syst."},{"key":"R20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ijpe.2014.07.015","volume":"158","author":"Wang","year":"2014","journal-title":"Int. J. Prod. Econ."},{"key":"R21","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1287\/ijoc.2015.0686","volume":"28","author":"Hashemi Doulabi","year":"2016","journal-title":"INFORMS J. Comput."},{"key":"R22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.orhc.2016.01.001","volume":"8","author":"Landa","year":"2016","journal-title":"Oper. Res. Health Care"},{"key":"R23","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ejor.2016.11.043","volume":"260","author":"Neyshabouri","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"R24","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1287\/opre.1080.0590","volume":"56","author":"Patrick","year":"2008","journal-title":"Oper. Res."},{"key":"R25","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/s10729-010-9127-6","volume":"13","author":"Zonderland","year":"2010","journal-title":"Health Care Manage. Sci."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"Hosseini N. and Taaffe K., Evaluation of optimal scheduling policy for accommodating elective and non-elective surgery via simulation. In: Proceedings of the 2014 Winter Simulation Conference. IEEE Press (2014) 1377\u20131386.","DOI":"10.1109\/WSC.2014.7019992"},{"key":"R27","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.ejor.2015.02.032","volume":"245","author":"Astaraky","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"R28","unstructured":"Kolobov A., Mausam  and Weld D.S., A theory of goal-oriented MDPs with dead ends. In: Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence. UAI\u201912 (2012) 438\u2013447."},{"key":"R29","unstructured":"Kolobov A., Mausam  and Weld D.S., Stochastic shortest path MDPs with dead ends. In: ICAPS Heuristics and Search for Domain Independent Planning (HSDIP) Workshop (2012)."},{"key":"R30","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1503\/cjs.019711","volume":"56","author":"Heng","year":"2013","journal-title":"Can. J. Surgery"},{"key":"R31","doi-asserted-by":"crossref","first-page":"e134","DOI":"10.1002\/bjs.9325","volume":"101","author":"Lepp\u00e4niemi","year":"2014","journal-title":"Br. J. Surgery"},{"key":"R32","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ejor.2011.02.025","volume":"213","author":"Adan","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"R33","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.orhc.2012.05.002","volume":"1","author":"van Essen","year":"2012","journal-title":"Oper. Res. Health Care"},{"key":"R34","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/j.dss.2012.10.021","volume":"55","author":"Tancrez","year":"2013","journal-title":"Decis. Support Syst."},{"key":"R35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1111\/j.1365-2753.2007.00794.x","volume":"14","author":"Testi","year":"2008","journal-title":"J. Eval. Clin. Pract."},{"key":"R36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1472-6963-9-1","volume":"9","author":"Valente","year":"2009","journal-title":"BMC Health Serv. Res."},{"key":"R37","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.ejor.2010.03.014","volume":"206","author":"Min","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2015.07.003","volume":"66","author":"Riise","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"R39","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10589-007-9084-2","volume":"40","author":"Punnakitikashem","year":"2008","journal-title":"Comput. Optim. App."},{"key":"R40","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.ejor.2012.10.029","volume":"226","author":"Holte","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"R41","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(94)00011-O","volume":"72","author":"Barto","year":"1995","journal-title":"Artif. Intell."},{"key":"R42","unstructured":"Bonet B. and Geffner H., Labeled RTDP: improving the convergence of real-time dynamic programming. In: Proceedings of Thirteenth International Conference on Automated Planning and Scheduling 3 (2003) 12\u201321."},{"key":"R43","unstructured":"McMahan H.B., Likhachev M. and Gordon G.J., Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In: Proceedings of the 22nd International Conference on Machine Learning. ACM (2005) 569\u2013576."},{"key":"R44","unstructured":"Smith T. and Simmons R., Focused real-time dynamic programming for MDPs: squeezing more out of a heuristic. In: Proceedings of the 21st National Conference on Artificial Intelligence. AAAI\u201906 2 (2006) 1227\u20131232."},{"key":"R45","unstructured":"Sanner S., Goetschalckx R., Driessens K. and Shani G., Bayesian real-time dynamic programming. Proceedings of the 21st International Joint Conference on Artifical Intelligence. IJCAI\u201909 (2009) 1784\u20131789."},{"key":"R46","unstructured":"Zhang J., Dridi M. and El Moudni A., A stochastic shortest-path MDP model with dead ends for operating rooms planning. In: 2017 23rd International Conference on Automation and Computing (ICAC). IEEE (2017) 1\u20136."},{"key":"R47","first-page":"232","volume":"98","author":"Strum","year":"2003","journal-title":"Anesthesiol. J. Am. Soc. Anesthesiologists"},{"key":"R48","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.cor.2016.04.017","volume":"74","author":"Xiao","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"R49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00426ED1V01Y201206AIM017","volume":"6","author":"Mausam","year":"2012","journal-title":"Synth. Lect. Artif. Intel. Mach. Learn."},{"key":"R50","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1080\/07408170802165831","volume":"40","author":"Lamiri","year":"2008","journal-title":"IIE Trans."},{"key":"R51","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1016\/j.ejor.2017.12.025","volume":"267","author":"Koppka","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"R52","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/mnsc.1070.0756","volume":"54","author":"Olivares","year":"2008","journal-title":"Manage. Sci."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018110\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T08:16:13Z","timestamp":1584692173000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,15]]},"references-count":52,"journal-issue":{"issue":"5"},"alternative-id":["ro180110"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018110","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2019,10,15]]}}}