title: Simulation-based approximate policy iteration for dynamic patient scheduling for radiation therapy.
abstract: We study radiation therapy scheduling problem where dynamically and stochastically arriving patients of different types are scheduled to future days. Unlike similar models in the literature, we consider cancellation of treatments. We formulate this dynamic multi-appointment patient scheduling problem as a Markov Decision Process (MDP). Since the MDP is intractable due to large state and action spaces, we employ a simulation-based approximate dynamic programming (ADP) approach to approximately solve our model. In particular, we develop Least-square based approximate policy iteration for solving our model. The performance of the ADP approach is compared with that of a myopic heuristic decision rule.
authors.affiliation: Department of Industrial Engineering, Istanbul Kemerburgaz University, Istanbul, Turkey. yasin.gocgun@kemerburgaz.edu.tr.
authors.forename: Yasin
authors.initials: Y
authors.lastname: Gocgun
mesh_terms: D000465:Algorithms; D001071:Appointments and Schedules; D003198:Computer Simulation; D006801:Humans; D008390:Markov Chains; D057766:Policy; D011878:Radiotherapy
keywords: Approximate dynamic programming; Markov decision processes; Patient scheduling