Ege Ozyuksel , Serhat Gul , Tonguç Ünlüyurt , Batuhan Çelik
{"title":"在不确定的情况下协调肿瘤医生预约化疗","authors":"Ege Ozyuksel , Serhat Gul , Tonguç Ünlüyurt , Batuhan Çelik","doi":"10.1016/j.cie.2025.111123","DOIUrl":null,"url":null,"abstract":"<div><div>Scheduling chemotherapy treatments in outpatient chemotherapy clinics (OCCs) presents significant challenges due to limited resources, uncertainty in infusion durations, and the need for coordinating with oncologist consultations. This study addresses these challenges through integrating oncologist consultation and chemotherapy scheduling by determining appointment times for a daily list of patients. A two-stage stochastic mixed-integer programming model is developed, considering stochastic factors such as infusion durations and the statuses of chemotherapy treatment approvals after consultations. In the first stage of the model, patients of each oncologist are organized in a sequence, and appointment times are set. In the second stage, patients are assigned to chairs and nurses using an optimal myopic policy. The objective function penalizes the expected weighted sum of the total working time of the OCC and the waiting times of patients. To represent the original scenario set by a reduced scenario set, a scenario reduction algorithm is employed. The algorithm, a Wasserstein Distance-Based Local Search Algorithm (WD-LSA), is tested using real data from a major academic oncology hospital in Turkey. The performance of the WD-LSA algorithm is demonstrated by comparing with CPLEX for smaller number of scenarios and with heuristic algorithms for larger number of scenarios. We find that the gap is quite small when compared with CPLEX solutions and the solutions are much better than the solutions found by the practical scheduling heuristics from the literature. The trade-off between patient waiting time and total working time is assessed. The dependency of the performance measures to the number of oncologists and nurses is investigated. Lastly, the value of stochastic solution is estimated.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111123"},"PeriodicalIF":6.7000,"publicationDate":"2025-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Coordinating oncologist appointments with chemotherapy treatments under uncertainty\",\"authors\":\"Ege Ozyuksel , Serhat Gul , Tonguç Ünlüyurt , Batuhan Çelik\",\"doi\":\"10.1016/j.cie.2025.111123\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Scheduling chemotherapy treatments in outpatient chemotherapy clinics (OCCs) presents significant challenges due to limited resources, uncertainty in infusion durations, and the need for coordinating with oncologist consultations. This study addresses these challenges through integrating oncologist consultation and chemotherapy scheduling by determining appointment times for a daily list of patients. A two-stage stochastic mixed-integer programming model is developed, considering stochastic factors such as infusion durations and the statuses of chemotherapy treatment approvals after consultations. In the first stage of the model, patients of each oncologist are organized in a sequence, and appointment times are set. In the second stage, patients are assigned to chairs and nurses using an optimal myopic policy. The objective function penalizes the expected weighted sum of the total working time of the OCC and the waiting times of patients. To represent the original scenario set by a reduced scenario set, a scenario reduction algorithm is employed. The algorithm, a Wasserstein Distance-Based Local Search Algorithm (WD-LSA), is tested using real data from a major academic oncology hospital in Turkey. The performance of the WD-LSA algorithm is demonstrated by comparing with CPLEX for smaller number of scenarios and with heuristic algorithms for larger number of scenarios. We find that the gap is quite small when compared with CPLEX solutions and the solutions are much better than the solutions found by the practical scheduling heuristics from the literature. The trade-off between patient waiting time and total working time is assessed. The dependency of the performance measures to the number of oncologists and nurses is investigated. Lastly, the value of stochastic solution is estimated.</div></div>\",\"PeriodicalId\":55220,\"journal\":{\"name\":\"Computers & Industrial Engineering\",\"volume\":\"204 \",\"pages\":\"Article 111123\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Industrial Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0360835225002694\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835225002694","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Coordinating oncologist appointments with chemotherapy treatments under uncertainty
Scheduling chemotherapy treatments in outpatient chemotherapy clinics (OCCs) presents significant challenges due to limited resources, uncertainty in infusion durations, and the need for coordinating with oncologist consultations. This study addresses these challenges through integrating oncologist consultation and chemotherapy scheduling by determining appointment times for a daily list of patients. A two-stage stochastic mixed-integer programming model is developed, considering stochastic factors such as infusion durations and the statuses of chemotherapy treatment approvals after consultations. In the first stage of the model, patients of each oncologist are organized in a sequence, and appointment times are set. In the second stage, patients are assigned to chairs and nurses using an optimal myopic policy. The objective function penalizes the expected weighted sum of the total working time of the OCC and the waiting times of patients. To represent the original scenario set by a reduced scenario set, a scenario reduction algorithm is employed. The algorithm, a Wasserstein Distance-Based Local Search Algorithm (WD-LSA), is tested using real data from a major academic oncology hospital in Turkey. The performance of the WD-LSA algorithm is demonstrated by comparing with CPLEX for smaller number of scenarios and with heuristic algorithms for larger number of scenarios. We find that the gap is quite small when compared with CPLEX solutions and the solutions are much better than the solutions found by the practical scheduling heuristics from the literature. The trade-off between patient waiting time and total working time is assessed. The dependency of the performance measures to the number of oncologists and nurses is investigated. Lastly, the value of stochastic solution is estimated.
期刊介绍:
Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.