{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T17:06:44Z","timestamp":1773335204398,"version":"3.50.1"},"reference-count":48,"publisher":"Elsevier BV","issue":"1","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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejor.2025.12.021","type":"journal-article","created":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T16:50:23Z","timestamp":1765903823000},"page":"66-83","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A branch and price algorithm for scheduling in surgery pre-admission testing clinics"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0717-3131","authenticated-orcid":false,"given":"Mohammad","family":"Al Syouf","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1138-0665","authenticated-orcid":false,"given":"Ankit","family":"Bansal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3570-6444","authenticated-orcid":false,"given":"Saligrama","family":"Agnihothri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2025.12.021_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105896","article-title":"A branch-and-price algorithm for a routing problem with inbound and outbound requests","volume":"146","author":"Agius","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.021_bib0002","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2023.102994","article-title":"Appointment scheduling in surgery pre-admission testing clinics","volume":"123","author":"Agnihothri","year":"2024","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2025.12.021_bib0003","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ejor.2016.06.064","article-title":"Outpatient appointment systems in healthcare: A review of optimization studies","volume":"258(1)","author":"Ahmadi-Javid","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.021_bib0004","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":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.021_bib0005","article-title":"An optimization model for multi-appointment scheduling in an outpatient cardiology setting","volume":"26","author":"Apergi","year":"2020","journal-title":"Operations Research for Healthcare"},{"key":"10.1016\/j.ejor.2025.12.021_bib0006","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":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0007","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: Column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.12.021_bib0008","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","article-title":"Dynamic transportation of patients in hospitals","volume":"32","author":"Beaudry","year":"2010","journal-title":"OR Spectrum"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0009","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.ejor.2006.10.060","article-title":"A branch-and-price approach for integrating nurse and surgery scheduling","volume":"189","author":"Beli\u00ebn","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.021_bib0010","series-title":"Introduction to linear optimization","volume":"vol. 6","author":"Bertsimas","year":"1997"},{"key":"10.1016\/j.ejor.2025.12.021_bib0011","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1111\/j.1937-5956.2003.tb00218.x","article-title":"Outpatient scheduling in health care: A review of literature","volume":"12(4)","author":"Cayirli","year":"2003","journal-title":"Production and Operations Management"},{"key":"10.1016\/j.ejor.2025.12.021_bib0012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orhc.2017.06.001","article-title":"Or problems related to home health care: A review of relevant routing and scheduling problems","volume":"13","author":"Ciss\u00e9","year":"2017","journal-title":"Operations Research for Health Care"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.021_bib0013","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.dss.2012.10.017","article-title":"Towards a centralised appointments system to optimise the length of patient stay","volume":"55","author":"Cordier","year":"2013","journal-title":"Decision Support Systems"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.021_bib0014","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/trsc.2018.0878","article-title":"Exact branch-price-and-cut algorithms for vehicle routing","volume":"53","author":"Costa","year":"2019","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0015","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1287\/ijoc.2019.0915","article-title":"A branch-price-and-cut procedure for the discrete ordered median problem","volume":"32","author":"Deleplanque","year":"2020","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0016","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.1070.0246","article-title":"Heuristic and exact algorithms for the identical parallel machine scheduling problem","volume":"20","author":"Dell\u2019Amico","year":"2008","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.12.021_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107255","article-title":"Routing and scheduling in home health care: A literature survey and bibliometric analysis","volume":"158","author":"Di Mascolo","year":"2021","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0018","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","article-title":"Synchronization in vehicle routing-a survey of VRPs with multiple synchronization constraints","volume":"46","author":"Drexl","year":"2012","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0019","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","article-title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","volume":"44","author":"Feillet","year":"2004","journal-title":"Networks: An International Journal"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.021_bib0020","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2018.06.046","article-title":"Column generation for vehicle routing problems with multiple synchronization constraints","volume":"272","author":"Fink","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.021_bib0021","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12532-017-0122-5","article-title":"Branch-and-cut for linear programs with overlapping SOS1 constraints","volume":"10","author":"Fischer","year":"2018","journal-title":"Mathematical Programming Computation"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.021_bib0022","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1080\/24725579.2018.1530314","article-title":"Hospital-wide therapist scheduling and routing: Exact and heuristic methods","volume":"8","author":"Gartner","year":"2018","journal-title":"IISE Transactions on Healthcare Systems Engineering"},{"issue":"9","key":"10.1016\/j.ejor.2025.12.021_bib0023","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1080\/07408170802165880","article-title":"Appointment scheduling in health care: Challenges and opportunities","volume":"40","author":"Gupta","year":"2008","journal-title":"IIE Transactions"},{"key":"10.1016\/j.ejor.2025.12.021_bib0024","first-page":"65","article-title":"Patient appointments in ambulatory care","author":"Gupta","year":"2012"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0025","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1287\/inte.1080.0379","article-title":"Bringing robustness to patient flow management through optimized patient transports in hospitals","volume":"39","author":"Hanne","year":"2009","journal-title":"Interfaces"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.021_bib0026","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1287\/trsc.2019.0956","article-title":"Vehicle routing problems with synchronized visits and stochastic travel and service times: Applications in healthcare","volume":"54","author":"Hashemi Doulabi","year":"2020","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0027","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1287\/ijoc.2015.0686","article-title":"A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling","volume":"28","author":"Hashemi Doulabi","year":"2016","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.021_bib0028","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1287\/ijoc.2021.1119","article-title":"Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity","volume":"34","author":"Jungwirth","year":"2022","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.12.021_bib0029","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.tre.2019.07.012","article-title":"Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution","volume":"129","author":"Kramer","year":"2019","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.021_bib0030","doi-asserted-by":"crossref","first-page":"3134","DOI":"10.1287\/ijoc.2022.1223","article-title":"A branch-and-price algorithm for the multiple knapsack problem","volume":"34","author":"Lalonde","year":"2022","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.021_bib0031","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1287\/ijoc.2023.0019","article-title":"A dedicated pricing algorithm to solve a large family of nurse scheduling problems with branch-and-price","volume":"36","author":"Legrain","year":"2024","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.12.021_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2020.101955","article-title":"Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows","volume":"140","author":"Li","year":"2020","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2025.12.021_bib0033","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ejor.2018.03.001","article-title":"Literature review on multi-appointment scheduling problems in hospitals","volume":"272(2)","author":"Marynissen","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.021_bib0034","series-title":"Massachusetts general hospital\u2019s pre-admission testing area (PATA)","author":"McCarty","year":"2012"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.021_bib0035","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/20476965.2019.1569481","article-title":"Designing and scheduling a multi-disciplinary integrated practice unit for patient-centred care","volume":"9","author":"Morrice","year":"2020","journal-title":"Health Systems"},{"key":"10.1016\/j.ejor.2025.12.021_bib0036","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","article-title":"Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning","volume":"19","author":"Morrison","year":"2016","journal-title":"Discrete Optimization"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.021_bib0037","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/ijoc.2016.0706","article-title":"The surgical patient routing problem: A central planner approach","volume":"28","author":"Nemati","year":"2016","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.021_bib0038","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1287\/ijoc.2018.0854","article-title":"An improved branch-cut-and-price algorithm for parallel machine scheduling problems","volume":"32","author":"Oliveira","year":"2020","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.021_bib0039","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2023.01.024","article-title":"Patient appointment scheduling at hemodialysis centers: An exact branch and price approach","volume":"309","author":"Reihaneh","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.021_bib0040","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1287\/trsc.1120.0452","article-title":"Examination and operating room scheduling including optimization of intrahospital routing","volume":"48","author":"Schmid","year":"2014","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0041","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.ejor.2023.04.007","article-title":"Synchronisation in vehicle routing: Classification schema, modelling framework and literature review","volume":"313","author":"Soares","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.021_bib0042","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.ejor.2016.01.003","article-title":"Integer programming formulations for the elementary shortest path problem","volume":"252","author":"Taccari","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"67(3)","key":"10.1016\/j.ejor.2025.12.021_bib0043","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1287\/opre.2018.1816","article-title":"Coordinated patient appointment scheduling for a multi-station healthcare network","author":"Wang","year":"2019","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0044","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1111\/j.1937-5956.2011.01220.x","article-title":"The effect of integrated scheduling and capacity policies on clinical efficiency","volume":"20","author":"White","year":"2011","journal-title":"Production and Operations Management"},{"key":"10.1016\/j.ejor.2025.12.021_bib0045","series-title":"Integer programming","author":"Wolsey","year":"2020"},{"key":"10.1016\/j.ejor.2025.12.021_bib0046","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.110932","article-title":"Location-routing optimization problem of pharmaceutical cold chain logistics with oil-electric mixed fleets under uncertainties","volume":"201","author":"Xu","year":"2025","journal-title":"Computers & Industrial Engineering"},{"issue":"10","key":"10.1016\/j.ejor.2025.12.021_bib0047","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1080\/24725854.2018.1542544","article-title":"Extended open shop scheduling with resource constraints: Appointment scheduling for integrated practice units","volume":"51","author":"Zhang","year":"2019","journal-title":"IISE Transactions"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.021_bib0048","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1287\/ijoc.2019.0894","article-title":"Branch and price for chance-constrained bin packing","volume":"32","author":"Zhang","year":"2020","journal-title":"INFORMS Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009889?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009889?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T05:29:08Z","timestamp":1773293348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0377221725009889"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.021","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A branch and price algorithm for scheduling in surgery pre-admission testing clinics","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}