Advance Patient Appointment Scheduling

This chapter describes the use of the linear programming approach to approximate dynamic programming as a means of solving advance patient appointment scheduling problems, which are problems typically intractable using standard solution techniques. Starting from the linear programming approach to discounted infinite-horizon Markov decision processes, and employing an affine value function approximation in the state variables, the method described in this chapter provides a systematic way of identifying effective booking guidelines for advance patient appointment scheduling problems. Two applications found in the literature allow us to show how these guidelines could be used in practice to significantly increase service levels for medical appointments, measured as the percentage of patients booked within medically acceptable wait times, and thus to decrease the potential impact of delays on patients’ health.

[1]  F. d'Epenoux,et al.  A Probabilistic Production and Inventory Problem , 1963 .

[2]  Cyrus Derman,et al.  Finite State Markovian Decision Processes , 1970 .

[3]  J. B. Martin,et al.  Surgical demand scheduling: a review. , 1978, Health services research.

[4]  P. Schweitzer,et al.  Generalized polynomial approximations in Markovian decision processes , 1985 .

[5]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[6]  Benjamin Van Roy,et al.  The Linear Programming Approach to Approximate Dynamic Programming , 2003, Oper. Res..

[7]  Benjamin Van Roy,et al.  On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming , 2004, Math. Oper. Res..

[8]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[9]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[10]  W. Ben‐Ameur,et al.  Acceleration of cutting-plane and column generation algorithms: Applications to network design , 2007 .

[11]  Daniel Adelman,et al.  Relaxations of Weakly Coupled Stochastic Dynamic Programs , 2008, Oper. Res..

[12]  Diwakar Gupta,et al.  Appointment scheduling in health care: Challenges and opportunities , 2008 .

[13]  Maurice Queyranne,et al.  Dynamic Multipriority Patient Scheduling for a Diagnostic Resource , 2008, Oper. Res..

[14]  Emre A. Veral,et al.  OUTPATIENT SCHEDULING IN HEALTH CARE: A REVIEW OF LITERATURE , 2003 .

[15]  Huseyin Topaloglu,et al.  Computing protection level policies for dynamic capacity allocation problems by using stochastic approximation methods , 2009 .

[16]  Vivek F. Farias,et al.  A Smoothed Approximate Linear Program , 2009, NIPS.

[17]  Susana V. Mondschein,et al.  APPOINTMENT POLICIES IN SERVICE OPERATIONS: A CRITICAL ANALYSIS OF THE ECONOMIC FRAMEWORK , 2003 .

[18]  Erik Demeulemeester,et al.  Operating room planning and scheduling: A literature review , 2010, Eur. J. Oper. Res..

[19]  Warren B. Powell,et al.  “Approximate dynamic programming: Solving the curses of dimensionality” by Warren B. Powell , 2007, Wiley Series in Probability and Statistics.

[20]  Maurice Queyranne,et al.  Appointment Scheduling with Discrete Random Durations , 2009, Math. Oper. Res..

[21]  Diego Klabjan,et al.  Computing Near-Optimal Policies in Generalized Joint Replenishment , 2012, INFORMS J. Comput..

[22]  Antoine Sauré Approximate dynamic programming methods for advance patient scheduling , 2012 .

[23]  Martin L. Puterman,et al.  Dynamic multi-appointment patient scheduling for radiation therapy , 2012, European Journal of Operational Research.

[24]  Rainer Kolisch,et al.  Approximate Dynamic Programming for Capacity Allocation in the Service Industry , 2010, Eur. J. Oper. Res..

[25]  Martin L Puterman,et al.  Dynamic scheduling with due dates and time windows: an application to chemotherapy patient appointment booking , 2013, Health Care Management Science.

[26]  Martin L. Puterman,et al.  Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions , 2015 .