{"title":"来自多种渠道的预约请求:根据患者偏好确定最佳预约日组合","authors":"Feray Tunçalp, Lerzan Örmeci","doi":"10.1287/stsy.2022.0029","DOIUrl":null,"url":null,"abstract":"We consider the appointment scheduling for a physician in a healthcare facility. Patients, of two types differentiated by their revenues and day preferences, contact the facility through either a call center to be scheduled immediately or a website to be scheduled the following morning. The facility aims to maximize the long-run average revenue, while ensuring that a certain service level is satisfied for patients generating lower revenue. The facility has two decisions: offering a set of appointment days and choosing the patient type to prioritize while contacting the website patients. Model 1 is a periodic Markov Decision Process (MDP) model without the service-level constraint. We establish certain structural properties of Model 1, while providing sufficient conditions for the existence of a preferred patient type and for the nonoptimality of the commonly used offer-all policy. We also demonstrate the importance of patient preference in determining the preferred type. Model 2 is the constrained MDP model that accommodates the service-level constraint and has an optimal randomized policy with a special structure. This allows developing an efficient method to identify a well-performing policy. We illustrate the performance of this policy through numerical experiments, for systems with and without no-shows.Supplemental Material: The online appendix is available at https://doi.org/10.1287/stsy.2022.0029 .","PeriodicalId":36337,"journal":{"name":"Stochastic Systems","volume":"9 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Appointment Requests from Multiple Channels: Characterizing Optimal Set of Appointment Days to Offer with Patient Preferences\",\"authors\":\"Feray Tunçalp, Lerzan Örmeci\",\"doi\":\"10.1287/stsy.2022.0029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the appointment scheduling for a physician in a healthcare facility. Patients, of two types differentiated by their revenues and day preferences, contact the facility through either a call center to be scheduled immediately or a website to be scheduled the following morning. The facility aims to maximize the long-run average revenue, while ensuring that a certain service level is satisfied for patients generating lower revenue. The facility has two decisions: offering a set of appointment days and choosing the patient type to prioritize while contacting the website patients. Model 1 is a periodic Markov Decision Process (MDP) model without the service-level constraint. We establish certain structural properties of Model 1, while providing sufficient conditions for the existence of a preferred patient type and for the nonoptimality of the commonly used offer-all policy. We also demonstrate the importance of patient preference in determining the preferred type. Model 2 is the constrained MDP model that accommodates the service-level constraint and has an optimal randomized policy with a special structure. This allows developing an efficient method to identify a well-performing policy. We illustrate the performance of this policy through numerical experiments, for systems with and without no-shows.Supplemental Material: The online appendix is available at https://doi.org/10.1287/stsy.2022.0029 .\",\"PeriodicalId\":36337,\"journal\":{\"name\":\"Stochastic Systems\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Stochastic Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/stsy.2022.0029\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Stochastic Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/stsy.2022.0029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
Appointment Requests from Multiple Channels: Characterizing Optimal Set of Appointment Days to Offer with Patient Preferences
We consider the appointment scheduling for a physician in a healthcare facility. Patients, of two types differentiated by their revenues and day preferences, contact the facility through either a call center to be scheduled immediately or a website to be scheduled the following morning. The facility aims to maximize the long-run average revenue, while ensuring that a certain service level is satisfied for patients generating lower revenue. The facility has two decisions: offering a set of appointment days and choosing the patient type to prioritize while contacting the website patients. Model 1 is a periodic Markov Decision Process (MDP) model without the service-level constraint. We establish certain structural properties of Model 1, while providing sufficient conditions for the existence of a preferred patient type and for the nonoptimality of the commonly used offer-all policy. We also demonstrate the importance of patient preference in determining the preferred type. Model 2 is the constrained MDP model that accommodates the service-level constraint and has an optimal randomized policy with a special structure. This allows developing an efficient method to identify a well-performing policy. We illustrate the performance of this policy through numerical experiments, for systems with and without no-shows.Supplemental Material: The online appendix is available at https://doi.org/10.1287/stsy.2022.0029 .