Simple Heuristics for Near-Optimal Appointment Scheduling in Primary Care

In primary care allocating appointments to sequential requests can result in sub-optimal scheduling. Optimal scheduling requires hiring of consultants to analyze historical patterns. Many practices focus their resources on larger problems instead of optimizing appointment schedules. We simulate simple heuristics to compare their performance with optimal schedules uncovered using offline optimization models. We use uncapacitated appointment calendars for a nationally representative heterogeneous primary care panel to meet all patients' requests. The stochastic nature of appointment requests gives a distribution for daily appointments and for the uncovered optimal capacity. The First Minimum heuristic gives near-optimal schedules and can be easily implemented in small practices using pen-and-paper, without any investment in computer-systems.