Dynamic appointment scheduling with patient time preferences and different service time lengths

Anne Zander*, Uta Mohring

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Downloads (Pure)


Advance admission scheduling in the field of health care is an important and complex problem. Often, exact models of realistic size cannot be solved due to the curse of dimensionality and heuristics have to be used. In this paper we consider the appointment schedule of a physician's day. We assume patient types defined by different time preferences and service time lengths. Patient requests for the day are handled directly during a booking horizon. We present a mixed integer linear programming model to determine a set of appointments to offer a patient requesting an appointment. The objective is to schedule the requesting patient while also taking future demand into account. We want to maximize the overall utilization assuring a certain fairness level. We further perform a simulation in order to test the mixed integer linear program and to compare it to simpler online heuristics. We develop different scenarios and show that using the mixed integer linear program to schedule patients is beneficial.
Original languageEnglish
Title of host publicationLecture Notes in Management Science
Place of PublicationVancouver
PublisherORLab Analytics
ISBN (Electronic)1927-0097
ISBN (Print)2008-0050
Publication statusPublished - 2016
Externally publishedYes
Event8th International Conference on Applied Operational Research, ICAOR 2016 - Rotterdam, Netherlands
Duration: 28 Jun 201630 Jun 2016
Conference number: 8


Conference8th International Conference on Applied Operational Research, ICAOR 2016
Abbreviated titleICAOR

Cite this