Health Care Management Science

, Volume 10, Issue 3, pp 217–229 | Cite as

Optimal outpatient appointment scheduling

Open Access
Article

Abstract

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.

Keywords

Patient scheduling Health care Local search Multimodularity 

References

  1. 1.
    Bailey NTJ, Welch JD (1952) Appointment systems in hospital outpatient departments. Lancet 259:1105–1108CrossRefGoogle Scholar
  2. 2.
    Cayirli T, Veral E (2003) Outpatient scheduling in health care: a review of literature. Prod Oper Manag 12:519–549Google Scholar
  3. 3.
    Denton B, Gupta D (2003) A sequential bounding approach for optimal appointment scheduling. IIE Trans 35:1003–1016CrossRefGoogle Scholar
  4. 4.
    Hajek B (1985) Extremal splitting of point processes. Math Oper Res 22:543–556CrossRefGoogle Scholar
  5. 5.
    Hassin R, Mendel S (2006) Scheduling arrivals to queues: a model with no-shows. Working paperGoogle Scholar
  6. 6.
    Hutzschenreuter A (2005) Queueing models for outpatient appointment scheduling. M.Sc Thesis, University of UlmGoogle Scholar
  7. 7.
    Koole G, van der Sluis E (2003) Optimal shift scheduling with a global service level constraint. IIE Trans 35:1049–1055CrossRefGoogle Scholar
  8. 8.
    Lau H, Lau AH (2000) A fast procedure for computing the total system cost of an appointment schedule for medical and kindred facilities. IIE Trans 32:833–839CrossRefGoogle Scholar
  9. 9.
    Liao C, Pegden CD, Rosenshine M (1993) Planning timely arrivals to a stochastic production or service system. IIE Trans 25:36–73Google Scholar
  10. 10.
    Pegden CD, Rosenshine M (1990) Scheduling arrivals to queues. Comput Oper Res 17:343–348CrossRefGoogle Scholar
  11. 11.
    Righter R (1994) Scheduling. In: Shaked M, Shanthikumar, JG (eds) Stochastic orders and their applications. Academic, New YorkGoogle Scholar
  12. 12.
    Robinson LW, Chen RR (2003) Scheduling doctors’ appointments: optimal and empirically-based heuristic policies. IIE Trans 35:295–307CrossRefGoogle Scholar
  13. 13.
    Vanden Bosche PM, Dietz DC (2000) Minimizing expected waiting in a medical appointment system. IIE Trans 32:841–848CrossRefGoogle Scholar
  14. 14.
    Vanden Bosche PM, Dietz DC (2001) Scheduling and sequencing arrivals to an appointment system. J Serv Res 4:15–25CrossRefGoogle Scholar
  15. 15.
    Vanden Bosche PM, Dietz DC, Simeoni JR (1999) Scheduling customer arrivals to a stochastic service system. Nav Res Logist 46:549–559CrossRefGoogle Scholar
  16. 16.
    Wang PP (1993) Static and dynamic scheduling of customer arrivals to a single-server system. Nav Res Logist 40:345–360CrossRefGoogle Scholar
  17. 17.
    Wang PP (1997) Optimally scheduling N customer arrival times for a single-server system. Comput Oper Res 24:703–716CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Department of Epidemiology & BiostatisticsErasmus Medical CenterRotterdamThe Netherlands
  2. 2.Department of MathematicsVU University AmsterdamAmsterdamThe Netherlands
  3. 3.Department of MathematicsVrije UniversiteitAmsterdamHolland

Personalised recommendations