{"title":"具有专用/灵活资源和合作操作的手术室调度问题的人工蜂群算法","authors":"G. Bektur, Hatice Kübra Aslan","doi":"10.11121/ijocta.1466","DOIUrl":null,"url":null,"abstract":"In this study operating room scheduling (ORS) problem is addressed in multi-resource manner. In the addressed problem, besides operating rooms (ORs) and surgeons, the anesthesia team is also considered as an additional resource. The surgeon(s) who will perform the operation have already been assigned to the patients and is a dedicated resource. The assignment of the anesthesia team has been considered as a decision problem and a flexible resource. In this study, cooperative operations are also considered. A mixed integer linear programming (MILP) model is proposed for the problem. Since the problem is NP-hard, an artificial bee colony (ABC) algorithm is proposed for the problem. The solutions of the ABC are compared with the MILP model and random search.","PeriodicalId":505378,"journal":{"name":"An International Journal of Optimization and Control: Theories & Applications (IJOCTA)","volume":"51 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Artificial bee colony algorithm for operating room scheduling problem with dedicated/flexible resources and cooperative operations\",\"authors\":\"G. Bektur, Hatice Kübra Aslan\",\"doi\":\"10.11121/ijocta.1466\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study operating room scheduling (ORS) problem is addressed in multi-resource manner. In the addressed problem, besides operating rooms (ORs) and surgeons, the anesthesia team is also considered as an additional resource. The surgeon(s) who will perform the operation have already been assigned to the patients and is a dedicated resource. The assignment of the anesthesia team has been considered as a decision problem and a flexible resource. In this study, cooperative operations are also considered. A mixed integer linear programming (MILP) model is proposed for the problem. Since the problem is NP-hard, an artificial bee colony (ABC) algorithm is proposed for the problem. The solutions of the ABC are compared with the MILP model and random search.\",\"PeriodicalId\":505378,\"journal\":{\"name\":\"An International Journal of Optimization and Control: Theories & Applications (IJOCTA)\",\"volume\":\"51 3\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"An International Journal of Optimization and Control: Theories & Applications (IJOCTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11121/ijocta.1466\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"An International Journal of Optimization and Control: Theories & Applications (IJOCTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11121/ijocta.1466","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Artificial bee colony algorithm for operating room scheduling problem with dedicated/flexible resources and cooperative operations
In this study operating room scheduling (ORS) problem is addressed in multi-resource manner. In the addressed problem, besides operating rooms (ORs) and surgeons, the anesthesia team is also considered as an additional resource. The surgeon(s) who will perform the operation have already been assigned to the patients and is a dedicated resource. The assignment of the anesthesia team has been considered as a decision problem and a flexible resource. In this study, cooperative operations are also considered. A mixed integer linear programming (MILP) model is proposed for the problem. Since the problem is NP-hard, an artificial bee colony (ABC) algorithm is proposed for the problem. The solutions of the ABC are compared with the MILP model and random search.