In this paper optimal outpatient appointment scheduling is studied. A local search procedure is derived that converges to the optimal schedule with a weighted average of expected waiting times of patients, idle time of the doctor and tardiness (lateness) as objective. No-shows are allowed to happen. For certain combinations of parameters the well-known Bailey-Welch rule is found to be the optimal appointment schedule.

Additional Metadata
Keywords Health care, Local search, Multimodularity, Patient scheduling
Persistent URL dx.doi.org/10.1007/s10729-007-9015-x, hdl.handle.net/1765/36779
Citation
Kaandorp, G.C, & Koole, G. (2007). Optimal outpatient appointment scheduling. Health Care Management Science, 10(3), 217–229. doi:10.1007/s10729-007-9015-x