Sequencing and Scheduling Appointments with Potential Call-In Patients

40 Pages Posted: 25 Jun 2011

See all articles by Rachel R. Chen

Rachel R. Chen

University of California, Davis - Graduate School of Management

Lawrence W. Robinson

Cornell University - Samuel Curtis Johnson Graduate School of Management

Date Written: June 9, 2011

Abstract

This paper considers an appointment scheduling system that accommodates routine patients who book well in advance as well as same-day patients with acute needs who call in the morning for an appointment later that day. In addition to determining the appointment times that are assigned up-front to the routine patients, our model is the first to determine when and how to slot in those last-minute same-day patients throughout the day. By formulating the problem as a stochastic linear program, our model includes patient no-shows, random service times, ancillary physician tasks, and appointment delays for same-day patients who prefer to see the doctor as soon as possible. We also develop two heuristic rules for the combinatorial problem of sequencing similar routine and same-day patients.

Keywords: appointment scheduling, sequencing, no-shows, advanced-access

Suggested Citation

Chen, Rachel R. and Robinson, Lawrence W., Sequencing and Scheduling Appointments with Potential Call-In Patients (June 9, 2011). UC Davis Graduate School of Management Research Paper, Available at SSRN: https://ssrn.com/abstract=1871125 or http://dx.doi.org/10.2139/ssrn.1871125

Rachel R. Chen (Contact Author)

University of California, Davis - Graduate School of Management ( email )

One Shields Avenue
Davis, CA 95616
United States
530-752-7619 (Phone)
530-752-2924 (Fax)

Lawrence W. Robinson

Cornell University - Samuel Curtis Johnson Graduate School of Management ( email )

Ithaca, NY 14853
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
135
Abstract Views
1,014
rank
263,788
PlumX Metrics