Advance Patient Appointment Scheduling

Saure, Antoine; Puterman, Martin L.; Boucherie, RJ; VanDijk, NM

Abstract

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.

Más información

Título según WOS: ID WOS:000417893900010 Not found in local WOS DB
Título de la Revista: MARKOV DECISION PROCESSES IN PRACTICE
Volumen: 248
Editorial: SPRINGER INTERNATIONAL PUBLISHING AG
Fecha de publicación: 2017
Página de inicio: 245
Página final: 268
DOI:

10.1007/978-3-319-47766-4_8

Notas: ISI