{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T11:19:22Z","timestamp":1724152762543},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012247","name":"Program of Shanghai Academic Research Leader","doi-asserted-by":"publisher","award":["21XD1401000"],"id":[{"id":"10.13039\/501100012247","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017350","name":"Shanghai Key Laboratory of Power Station Automation Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100017350","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973203","62273221"],"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":[[2023,12]]},"DOI":"10.1016\/j.cie.2023.109760","type":"journal-article","created":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T04:27:47Z","timestamp":1700195267000},"page":"109760","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["A slack speed-up based discrete artificial bee colony algorithm for resource-constrained operating room scheduling problem"],"prefix":"10.1016","volume":"186","author":[{"given":"Mei-Chen","family":"Yang","sequence":"first","affiliation":[]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7476-5039","authenticated-orcid":false,"given":"Hong-Yan","family":"Sang","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9803-2745","authenticated-orcid":false,"given":"Wei-Min","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6508-0051","authenticated-orcid":false,"given":"Yu-Long","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.cie.2023.109760_b0005","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1287\/msom.2019.0781","article-title":"Operating Room Staffing and Scheduling","volume":"22","author":"Bandi","year":"2020","journal-title":"Manufacturing & Service Operations Management"},{"key":"10.1016\/j.cie.2023.109760_b0010","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"},{"key":"10.1016\/j.cie.2023.109760_b0015","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.2023.109760_b0020","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":"2","key":"10.1016\/j.cie.2023.109760_b0025","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2017.06.051","article-title":"An integrated approach for scheduling health care activities in a hospital","volume":"264","author":"Burdett","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2023.109760_b0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106545","article-title":"Solving the hybrid flow shop scheduling problem with limited human resource constraint","volume":"146","author":"Costa","year":"2020","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.1016\/j.cie.2023.109760_b0035","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"},{"key":"10.1016\/j.cie.2023.109760_b0040","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.cor.2019.05.002","article-title":"Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective","volume":"109","author":"Fernandez-Viagas","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"6","key":"10.1016\/j.cie.2023.109760_b0045","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1111\/j.1937-5956.2007.tb00289.x","article-title":"Surgical Suites' Operations Management","volume":"16","author":"Gupta","year":"2007","journal-title":"Production and Operations Management"},{"issue":"3","key":"10.1016\/j.cie.2023.109760_b0050","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.cie.2023.109760_b0055","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.ejor.2023.03.038","article-title":"An Asymmetric Traveling Salesman Problem Based Matheuristic Algorithm for Flowshop Group Scheduling Problem","volume":"310","author":"He","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.cie.2023.109760_b0060","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1109\/TEVC.2021.3115795","article-title":"A Greedy Cooperative Co-Evolutionary Algorithm With Problem-Specific Knowledge for Multiobjective Flowshop Group Scheduling Problems","volume":"27","author":"He","year":"2023","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"10.1016\/j.cie.2023.109760_b0065","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1002\/nav.10060","article-title":"Scheduling patients in an ambulatory surgical center","volume":"50","author":"Hsu","year":"2003","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.cie.2023.109760_b0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.104016","article-title":"Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times","volume":"97","author":"Huang","year":"2021","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.cie.2023.109760_b0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.107021","article-title":"An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem","volume":"152","author":"Huang","year":"2021","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2023.109760_b0080","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ins.2014.03.127","article-title":"A variable iterated greedy algorithm for the traveling salesman problem with time windows","volume":"279","author":"Karabulut","year":"2014","journal-title":"Information Sciences"},{"issue":"5","key":"10.1016\/j.cie.2023.109760_b0085","doi-asserted-by":"crossref","first-page":"2684","DOI":"10.1109\/TSMC.2022.3219380","article-title":"An Improved Artificial Bee Colony Algorithm With Q-Learning for Solving Permutation Flow-Shop Scheduling Problems","volume":"53","author":"Li","year":"2023","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"10.1016\/j.cie.2023.109760_b0090","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.inffus.2021.10.002","article-title":"Multi-objective optimization algorithm based on characteristics fusion of dynamic social networks for community discovery","volume":"79","author":"Li","year":"2022","journal-title":"Information Fusion"},{"key":"10.1016\/j.cie.2023.109760_b0095","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":"Applied Soft Computing"},{"key":"10.1016\/j.cie.2023.109760_b0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114495","article-title":"An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance","volume":"169","author":"Mao","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2023.109760_b0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107826","article-title":"A robust multiobjective integrated master surgery schedule and surgical case assignment model at a publicly funded hospital","volume":"163","author":"Mazloumian","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2023.109760_b0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100804","article-title":"A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time","volume":"60","author":"Meng","year":"2021","journal-title":"Swarm and Evolutionary Computation"},{"issue":"1","key":"10.1016\/j.cie.2023.109760_b0115","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ejor.2022.02.019","article-title":"A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows","volume":"303","author":"Missaoui","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2023.109760_b0125","series-title":"Design and analysis of experiments","author":"Montgomery","year":"2017"},{"issue":"1","key":"10.1016\/j.cie.2023.109760_b0130","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"issue":"1","key":"10.1016\/j.cie.2023.109760_b0135","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.amjsurg.2021.07.033","article-title":"A contemporary reassessment of the US surgical workforce through 2050 predicts continued shortages and increased productivity demands","volume":"223","author":"Oslock","year":"2022","journal-title":"American Journal of Surgery"},{"issue":"12","key":"10.1016\/j.cie.2023.109760_b0140","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","article-title":"A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem","volume":"181","author":"Pan","year":"2011","journal-title":"Information Sciences"},{"key":"10.1016\/j.cie.2023.109760_b0145","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.amc.2017.01.004","article-title":"Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times","volume":"303","author":"Pan","year":"2017","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.cie.2023.109760_b0150","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","article-title":"Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem","volume":"124","author":"Pan","year":"2019","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"10.1016\/j.cie.2023.109760_b0155","doi-asserted-by":"crossref","first-page":"5999","DOI":"10.1109\/TCYB.2020.3041494","article-title":"An Effective Cooperative Co-Evolutionary Algorithm for Distributed Flowshop Group Scheduling Problems","volume":"52","author":"Pan","year":"2022","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"1","key":"10.1016\/j.cie.2023.109760_b0160","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0257-2","article-title":"Scheduling jobs on a k-stage flexible flow-shop","volume":"164","author":"Paternina-Arboleda","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cie.2023.109760_b0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2019.07.006","article-title":"Branch-and-check methods for multi-level operating room planning and scheduling","volume":"220","author":"Roshanaei","year":"2020","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"10.1016\/j.cie.2023.109760_b0175","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","article-title":"A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility","volume":"169","author":"Ruiz","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2023.109760_b0180","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","article-title":"Iterated Greedy methods for the distributed permutation flowshop scheduling problem","volume":"83","author":"Ruiz","year":"2019","journal-title":"Omega"},{"issue":"1","key":"10.1016\/j.cie.2023.109760_b0185","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","article-title":"The hybrid flow shop scheduling problem","volume":"205","author":"Ruiz","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2023.109760_b0190","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105482","article-title":"Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem","volume":"136","author":"Shao","year":"2021","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2023.109760_b0195","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.swevo.2017.12.005","article-title":"A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times","volume":"40","author":"Shao","year":"2018","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.cie.2023.109760_b0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.113147","article-title":"Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment","volume":"145","author":"Shao","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2023.109760_b0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108200","article-title":"An efficient self-adaptive artificial bee colony algorithm for the distributed resource-constrained hybrid flowshop problem","volume":"169","author":"Tao","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2023.109760_b0210","doi-asserted-by":"crossref","first-page":"131109","DOI":"10.1109\/ACCESS.2022.3229709","article-title":"A Two-Stage Genetic Artificial Bee Colony Algorithm for Solving Integrated Operating Room Planning and Scheduling Problem With Capacity Constraints of Downstream Wards","volume":"10","author":"Tayyab","year":"2022","journal-title":"IEEE Access"},{"issue":"3","key":"10.1016\/j.cie.2023.109760_b0215","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.ejor.2012.09.010","article-title":"A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital","volume":"224","author":"Vijayakumar","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2023.109760_b0225","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.2023.109760_b0230","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"},{"issue":"5","key":"10.1016\/j.cie.2023.109760_b0235","doi-asserted-by":"crossref","first-page":"3591","DOI":"10.1007\/s10586-022-03589-0","article-title":"An improved multi-objective imperialist competitive algorithm for surgical case scheduling problem with switching and preparation times","volume":"25","author":"Yu","year":"2022","journal-title":"Cluster Comput"},{"key":"10.1016\/j.cie.2023.109760_bib246","doi-asserted-by":"crossref","first-page":"107819","DOI":"10.1016\/j.knosys.2021.107819","article-title":"An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots","volume":"238","author":"Zhang","year":"2022","journal-title":"Knowledge-Based Systems"},{"issue":"3","key":"10.1016\/j.cie.2023.109760_b0240","doi-asserted-by":"crossref","first-page":"7006","DOI":"10.1109\/LRA.2022.3180040","article-title":"Modeling and Analysis of Operating Room Workflow in a Tertiary A Hospital","volume":"7","author":"Zheng","year":"2022","journal-title":"IEEE Robotics and Automation Letters"},{"key":"10.1016\/j.cie.2023.109760_b0245","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.cie.2016.09.003","article-title":"An improved Lagrangian relaxation heuristic for the scheduling problem of operating theatres","volume":"101","author":"Zhou","year":"2016","journal-title":"Computers & Industrial Engineering"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835223007842?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835223007842?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T01:11:16Z","timestamp":1701479476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835223007842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":47,"alternative-id":["S0360835223007842"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2023.109760","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2023,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A slack speed-up based discrete artificial bee colony algorithm for resource-constrained operating room scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2023.109760","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"109760"}}