{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:50:45Z","timestamp":1777956645482,"version":"3.51.4"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72371200"],"award-info":[{"award-number":["72371200"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71971172"],"award-info":[{"award-number":["71971172"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72301036"],"award-info":[{"award-number":["72301036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.cie.2026.111976","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T15:57:27Z","timestamp":1773676647000},"page":"111976","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Mixed-integer linear programming and constraint programming formulations for solving the three-stage no-wait surgery scheduling problem"],"prefix":"10.1016","volume":"216","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7689-3303","authenticated-orcid":false,"given":"Yaohui","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6597-0521","authenticated-orcid":false,"given":"Zequn","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2026.111976_b1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.cor.2014.08.014","article-title":"A two level metaheuristic for the operating room scheduling and assignment problem","volume":"54","author":"Aringhieri","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b2","first-page":"1","article-title":"Achieving operating room efficiency through process integration","volume":"57","author":"Association","year":"2003","journal-title":"Healthcare Financial Management: Journal of the Healthcare Financial Management Association"},{"issue":"2","key":"10.1016\/j.cie.2026.111976_b3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.cie.2009.04.019","article-title":"Operating theatre scheduling with patient recovery in both operating rooms and recovery beds","volume":"58","author":"Augusto","year":"2010","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2026.111976_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.104913","article-title":"Surgical case scheduling problem with fuzzy surgery time: An advanced bi-objective ant system approach","volume":"186","author":"Behmanesh","year":"2019","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.cie.2026.111976_b5","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/j.cie.2018.10.017","article-title":"Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints","volume":"126","author":"Belkhamsa","year":"2018","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b6","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.ejor.2009.04.011","article-title":"Operating room planning and scheduling: A literature review","volume":"201","author":"Cardoen","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.cie.2026.111976_b7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.cie.2012.03.018","article-title":"Parallel machine scheduling with flexible resources","volume":"63","author":"Edis","year":"2012","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.1016\/j.cie.2026.111976_b8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.cie.2009.02.012","article-title":"A planning and scheduling problem for an operating theatre using an open scheduling strategy","volume":"58","author":"Fei","year":"2010","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b9","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.ejor.2018.05.056","article-title":"Algorithms for the unrelated parallel machine scheduling problem with a resource constraint","volume":"271","author":"Fleszar","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111976_b10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.cie.2018.05.014","article-title":"A constraint programming approach for solving unrelated parallel machine scheduling problem","volume":"121","author":"Gedik","year":"2018","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"10.1016\/j.cie.2026.111976_b11","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state-variable machine: A solvable case of the traveling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/j.cie.2026.111976_b12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00996639","article-title":"Surgical unit time utilization review: resource utilization and management implications","volume":"12","author":"Gordon","year":"1988","journal-title":"Journal of Medical Systems"},{"key":"10.1016\/j.cie.2026.111976_b13","first-page":"287","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"Vol. 5","author":"Graham","year":"1979"},{"issue":"1","key":"10.1016\/j.cie.2026.111976_b14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0925-5273(03)00087-2","article-title":"Operating theatre planning","volume":"85","author":"Guinet","year":"2003","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b15","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1111\/j.1937-5956.2011.01232.x","article-title":"Bi-criteria scheduling of surgical services for an outpatient procedure center","volume":"20","author":"Gul","year":"2011","journal-title":"Production and Operations Management"},{"key":"10.1016\/j.cie.2026.111976_b16","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cie.2016.11.001","article-title":"Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches","volume":"102","author":"Ham","year":"2016","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b17","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":"24","key":"10.1016\/j.cie.2026.111976_b18","doi-asserted-by":"crossref","first-page":"18623","DOI":"10.1007\/s00500-023-09086-9","article-title":"Constraint programming models for the hybrid flow shop scheduling problem and its extensions","volume":"27","author":"I\u015f\u0131k","year":"2023","journal-title":"Soft Computing"},{"issue":"4","key":"10.1016\/j.cie.2026.111976_b19","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","article-title":"Algorithms for hybrid MILP\/CP models for a class of optimization problems","volume":"13","author":"Jain","year":"2001","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.cie.2026.111976_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.orhc.2019.100200","article-title":"Adaptive operating rooms planning and scheduling: A rolling horizon approach","volume":"22","author":"Kamran","year":"2019","journal-title":"Operations Research for Health Care"},{"issue":"2","key":"10.1016\/j.cie.2026.111976_b21","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1108\/MD-04-2018-0476","article-title":"Multi-objective surgery scheduling integrating surgeon constraints","volume":"57","author":"Khalfalli","year":"2019","journal-title":"Management Decision"},{"key":"10.1016\/j.cie.2026.111976_b22","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","article-title":"Mixed integer programming models for job shop scheduling: A computational analysis","volume":"73","author":"Ku","year":"2016","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.111976_b23","series-title":"International conference on the integration of constraint programming, artificial intelligence, and operations research","first-page":"403","article-title":"An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling","author":"Laborie","year":"2018"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b24","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1016\/j.ejor.2006.02.057","article-title":"A stochastic model for operating room planning with elective and emergency demand for surgery","volume":"185","author":"Lamiri","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111976_b25","first-page":"343","article-title":"Complexity of machine scheduling problems","volume":"Vol. 1","author":"Lenstra","year":"1977"},{"issue":"5","key":"10.1016\/j.cie.2026.111976_b26","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10878-024-01167-1","article-title":"Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms","volume":"47","author":"Li","year":"2024","journal-title":"Journal of Combinatorial Optimization"},{"issue":"5","key":"10.1016\/j.cie.2026.111976_b27","doi-asserted-by":"crossref","first-page":"739","DOI":"10.3390\/healthcare11050739","article-title":"Genetic algorithm for solving the no-wait three-stage surgery scheduling problem","volume":"11","author":"Lin","year":"2023","journal-title":"Healthcare"},{"issue":"2","key":"10.1016\/j.cie.2026.111976_b28","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.1100.0446","article-title":"An optimal constraint programming approach to the open-shop problem","volume":"24","author":"Malapert","year":"2012","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.cie.2026.111976_b29","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.ijpe.2019.03.021","article-title":"Job-shop scheduling problem with energy consideration","volume":"216","author":"Masmoudi","year":"2019","journal-title":"International Journal of Production Economics"},{"issue":"9","key":"10.1016\/j.cie.2026.111976_b30","doi-asserted-by":"crossref","first-page":"2601","DOI":"10.1016\/j.cor.2008.11.009","article-title":"A genetic algorithm for the proportionate multiprocessor open shop","volume":"36","author":"Matta","year":"2009","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.111976_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106347","article-title":"Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem","volume":"142","author":"Meng","year":"2020","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b32","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.ejor.2010.03.014","article-title":"Scheduling elective surgery under uncertainty and downstream capacity constraints","volume":"206","author":"Min","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"10.1016\/j.cie.2026.111976_b33","doi-asserted-by":"crossref","first-page":"3476","DOI":"10.1080\/00207543.2012.746480","article-title":"Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness","volume":"51","author":"Mousakhani","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"17","key":"10.1016\/j.cie.2026.111976_b34","doi-asserted-by":"crossref","first-page":"7754","DOI":"10.1016\/j.eswa.2014.06.023","article-title":"Modeling and heuristics for scheduling of distributed job shops","volume":"41","author":"Naderi","year":"2014","journal-title":"Expert Systems with Applications"},{"issue":"8","key":"10.1016\/j.cie.2026.111976_b35","doi-asserted-by":"crossref","first-page":"2608","DOI":"10.1111\/poms.13397","article-title":"Increased surgical capacity without additional resources: Generalized operating room planning and scheduling","volume":"30","author":"Naderi","year":"2021","journal-title":"Production and Operations Management"},{"issue":"4","key":"10.1016\/j.cie.2026.111976_b36","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1287\/ijoc.2023.1287","article-title":"Mixed-integer programming vs. constraint programming for shop scheduling problems: new results and outlook","volume":"35","author":"Naderi","year":"2023","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b37","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.ejor.2006.03.059","article-title":"Surgical case scheduling as a generalized job shop scheduling problem","volume":"185","author":"Pham","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.cie.2026.111976_b38","doi-asserted-by":"crossref","first-page":"15","DOI":"10.3390\/asi6010015","article-title":"A novel hybrid simulated annealing for no-wait open-shop surgical case scheduling problems","volume":"6","author":"Rahimi","year":"2023","journal-title":"Applied System Innovation"},{"key":"10.1016\/j.cie.2026.111976_b39","series-title":"Handbook of constraint programming","author":"Rossi","year":"2006"},{"key":"10.1016\/j.cie.2026.111976_b40","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2016.12.013","article-title":"On the exact solution of the no-wait flow shop problem with due date constraints","volume":"81","author":"Samarghandi","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2026.111976_b41","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.cie.2018.10.014","article-title":"Multi-period and multi-resource operating room scheduling under uncertainty: A case study","volume":"126","author":"Vali-Siar","year":"2018","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.1016\/j.cie.2026.111976_b42","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2015.06.008","article-title":"Scheduling operating theatres: Mixed integer programming vs. constraint programming","volume":"247","author":"Wang","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111976_b43","doi-asserted-by":"crossref","first-page":"10749","DOI":"10.1007\/s00500-021-06014-7","article-title":"Surgical rescheduling problem with emergency patients considering participants\u2019 dissatisfaction","volume":"25","author":"Wang","year":"2021","journal-title":"Soft Computing"},{"key":"10.1016\/j.cie.2026.111976_b44","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.cie.2015.04.010","article-title":"An ant colony optimization approach for solving an operating room surgery scheduling problem","volume":"85","author":"Xiang","year":"2015","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.1016\/j.cie.2026.111976_b45","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.artmed.2014.12.005","article-title":"A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints","volume":"63","author":"Xiang","year":"2015","journal-title":"Artificial Intelligence in Medicine"},{"key":"10.1016\/j.cie.2026.111976_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109760","article-title":"A slack speed-up based discrete artificial bee colony algorithm for resource-constrained operating room scheduling problem","volume":"186","author":"Yang","year":"2023","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2026.111976_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108668","article-title":"Ensemble meta-heuristics and Q-learning for staff dissatisfaction constrained surgery scheduling and rescheduling","volume":"134","author":"Yu","year":"2024","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.cie.2026.111976_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101686","article-title":"A Q-learning based artificial bee colony algorithm for solving surgery scheduling problems with setup time","volume":"90","author":"Zhang","year":"2024","journal-title":"Swarm and Evolutionary Computation"},{"issue":"3","key":"10.1016\/j.cie.2026.111976_b49","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.orhc.2014.05.003","article-title":"Scheduling elective surgeries with sequence-dependent setup times to multiple operating rooms using constraint programming","volume":"3","author":"Zhao","year":"2014","journal-title":"Operations Research for Health Care"},{"key":"10.1016\/j.cie.2026.111976_b50","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s10878-018-0322-6","article-title":"Operating room planning and surgical case scheduling: a review of literature","volume":"37","author":"Zhu","year":"2019","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835226001774?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835226001774?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T03:25:23Z","timestamp":1777951523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835226001774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":50,"alternative-id":["S0360835226001774"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2026.111976","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mixed-integer linear programming and constraint programming formulations for solving the three-stage no-wait surgery scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2026.111976","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111976"}}