Optimal outpatient appointment scheduling
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.
KeywordsPatient scheduling Health care Local search Multimodularity
- 2.Cayirli T, Veral E (2003) Outpatient scheduling in health care: a review of literature. Prod Oper Manag 12:519–549Google Scholar
- 5.Hassin R, Mendel S (2006) Scheduling arrivals to queues: a model with no-shows. Working paperGoogle Scholar
- 6.Hutzschenreuter A (2005) Queueing models for outpatient appointment scheduling. M.Sc Thesis, University of UlmGoogle Scholar
- 9.Liao C, Pegden CD, Rosenshine M (1993) Planning timely arrivals to a stochastic production or service system. IIE Trans 25:36–73Google Scholar
- 11.Righter R (1994) Scheduling. In: Shaked M, Shanthikumar, JG (eds) Stochastic orders and their applications. Academic, New YorkGoogle Scholar