{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:47:55Z","timestamp":1784206075376,"version":"3.55.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T00:00:00Z","timestamp":1705276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T00:00:00Z","timestamp":1705276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11424-024-3073-8","type":"journal-article","created":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T04:10:52Z","timestamp":1705291852000},"page":"1100-1113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Patients Transportation in Surgery Scheduling Problem"],"prefix":"10.1007","volume":"37","author":[{"given":"Nacira","family":"Chikhi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boualem","family":"Djehiche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,15]]},"reference":[{"issue":"3","key":"3073_CR1","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1111\/j.1937-5956.2011.01221.x","volume":"20","author":"J H May","year":"2011","unstructured":"May J H, Spangler W E, Strum D P, et al., The surgical scheduling problem: Current research and future opportunities, Production and Operations Management, 2011, 20(3): 392\u2013405.","journal-title":"Production and Operations Management"},{"key":"3073_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.cie.2016.05.016","volume":"97","author":"G Latorre-Nunez","year":"2016","unstructured":"Latorre-Nunez G, Ler-Villagra A, Marianov V, et al., Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries, Computers Industrial Engineering, 2016, 97: 248\u2013257.","journal-title":"Computers Industrial Engineering"},{"issue":"12","key":"3073_CR3","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"J M Framinan","year":"2004","unstructured":"Framinan J M, Gupta J N D, and Leisten R, A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, The Journal of the Operational Research Society, 2004, 55(12): 1243\u20131255.","journal-title":"The Journal of the Operational Research Society"},{"issue":"3","key":"3073_CR4","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1007\/s11831-020-09432-2","volume":"28","author":"I Rahimi","year":"2021","unstructured":"Rahimi I and Gandomi A H, A comprehensive review and analysis of operating room and surgery scheduling, Archives of Computational Methods in Engineering, 2021, 28(3): 1667\u20131688.","journal-title":"Archives of Computational Methods in Engineering"},{"key":"3073_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.cor.2014.08.014","volume":"54","author":"R Aringhieri","year":"2015","unstructured":"Aringhieri R, Landa P, Soriano P, et al., A two level metaheuristic for the operating room scheduling and assignment problem, Computers Operations Research, 2015, 54: 21\u201334.","journal-title":"Computers Operations Research"},{"issue":"2","key":"3073_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.artmed.2014.12.005","volume":"63","author":"W Xiang","year":"2015","unstructured":"Xiang W, Yin J, and Lim G, A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints, Artificial Intelligence in Medicine, 2015, 63(2): 91\u2013106.","journal-title":"Artificial Intelligence in Medicine"},{"key":"3073_CR7","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.cie.2018.10.017","volume":"126","author":"M Belkhamsa","year":"2018","unstructured":"Belkhamsa M, Jarboui B, and Masmoudi M, Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints, Computers Industrial Engineering, 2018, 126: 494\u2013506.","journal-title":"Computers Industrial Engineering"},{"key":"3073_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2015.07.003","volume":"66","author":"A Riise","year":"2016","unstructured":"Riise A, Mannino C, and Burke E K, Modelling and solving generalised operational surgery scheduling problems, Computers Operations Research, 2016, 66: 1\u201311.","journal-title":"Computers Operations Research"},{"key":"3073_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.cor.2016.11.009","volume":"87","author":"R Guido","year":"2017","unstructured":"Guido R and Conforti D, A hybrid genetic approach for solving an integrated multi-objective operating room planning and scheduling problem, Computers Operations Research, 2017, 87: 270\u2013282.","journal-title":"Computers Operations Research"},{"issue":"3","key":"3073_CR10","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.ejor.2018.09.003","volume":"273","author":"L S L Bastos","year":"2019","unstructured":"Bastos L S L, Marchesi J F, Hamacher S, et al., A mixed integer programming approach to the patient admission scheduling problem, European Journal of Operational Research, 2019, 273(3): 831\u2013840.","journal-title":"European Journal of Operational Research"},{"key":"3073_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.orhc.2017.09.004","volume":"15","author":"M Rezaeiahari","year":"2017","unstructured":"Rezaeiahari M and Khasawneh M T, An optimization model for scheduling patients in destination medical centers, Operations Research for Health Care, 2017, 15: 68\u201381.","journal-title":"Operations Research for Health Care"},{"key":"3073_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10878-019-00463-5","volume":"39","author":"S Zhu","year":"2020","unstructured":"Zhu S, Fan W J, Liu T Z, et al., Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs, Journal of Combinatorial Optimization, 2020, 39: 185\u2013215.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1\u20132","key":"3073_CR13","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10479-022-05094-4","volume":"321","author":"S Zhu","year":"2023","unstructured":"Zhu S, Fan W J, Yang S L, et al., Scheduling operating rooms of multiple hospitals considering transportation and deterioration in mass-casualty incidents, Annals of Operations Research, 2023, 321(1\u20132): 717\u2013753.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3073_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3390\/asi6010015","volume":"6","author":"A Rahimi","year":"2023","unstructured":"Rahimi A, Hejazi S M, Zandieh M, et al., A novel hybrid simulated annealing for no-wait open-shop surgical case scheduling problems, Applied System Innovation, 2023, 6(1): 15\u201336.","journal-title":"Applied System Innovation"},{"key":"3073_CR15","doi-asserted-by":"publisher","first-page":"105625","DOI":"10.1016\/j.cor.2021.105625","volume":"138","author":"A Hasani","year":"2022","unstructured":"Hasani Ali and Hosseini S M H, Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping, Computers Operations Research, 2022, 138: 105625.","journal-title":"Computers Operations Research"},{"issue":"2","key":"3073_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.cie.2009.04.019","volume":"58","author":"V Augusto","year":"2010","unstructured":"Augusto V, Xie X, and Perdomo V, Operating theatre scheduling with patient recovery in both operating rooms and recovery beds, Computers Industrial Engineering, 2010, 58(2): 231\u2013238.","journal-title":"Computers Industrial Engineering"},{"key":"3073_CR17","doi-asserted-by":"publisher","first-page":"106545","DOI":"10.1016\/j.cie.2020.106545","volume":"146","author":"A Costa","year":"2020","unstructured":"Costa A, Fernandez-Viagas V, and Framian J M, Solving the hybrid flow shop scheduling problem with limited human resource constraint, Computers Industrial Engineering, 2020, 146: 106545.","journal-title":"Computers Industrial Engineering"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-024-3073-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-024-3073-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-024-3073-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T02:38:48Z","timestamp":1712543928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-024-3073-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,15]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["3073"],"URL":"https:\/\/doi.org\/10.1007\/s11424-024-3073-8","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,15]]},"assertion":[{"value":"2 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}