Appointment scheduling with unscheduled arrivals and reprioritization

Nardo J. Borgman (Corresponding Author), Ingrid M.H. Vliegen, Richard J. Boucherie, Erwin W. Hans

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
48 Downloads (Pure)

Abstract

Inspired by the real life problem of a radiology department in a Dutch hospital, we study the problem of scheduling appointments, taking into account unscheduled arrivals and reprioritization. The radiology department offers CT diagnostics to both scheduled and unscheduled patients. Of these unscheduled patients, some must be seen immediately, while others may wait for some time. Herein a trade-off is sought between acceptable waiting times for appointment patients and unscheduled patients’ lateness. In this paper we use a discrete event simulation model to determine the performance of a given appointment schedule in terms of waiting time and lateness. Also we propose a constructive and local search heuristic that embeds this model and optimizes the schedule. For smaller instances, we verify the simulation model as well as compare our search heuristics’ performance with optimal schedules obtained using a Markov reward process. In addition we present computational results from the case study in the Dutch hospital. These results show that a considerable decrease of waiting time is possible for scheduled patients, while still treating unscheduled patients on time.
Original languageEnglish
Pages (from-to)30-53
Number of pages24
JournalFlexible services and manufacturing journal
Volume30
Issue number1-2
Early online date20 Jan 2017
DOIs
Publication statusPublished - Jun 2018

Fingerprint

Waiting Time
Schedule
Radiology
Scheduling
Simulation Model
Heuristic Search
Discrete event simulation
Discrete Event Simulation
Reward
Markov processes
Local Search
Immediately
Computational Results
Diagnostics
Trade-offs
Optimise
Heuristics
Verify
Decrease
Appointment scheduling

Keywords

  • UT-Hybrid-D
  • Radiology
  • Service operations
  • Heuristics
  • Appointment scheduling

Cite this

@article{b522d2ea590f40d18a4f9c263bd96621,
title = "Appointment scheduling with unscheduled arrivals and reprioritization",
abstract = "Inspired by the real life problem of a radiology department in a Dutch hospital, we study the problem of scheduling appointments, taking into account unscheduled arrivals and reprioritization. The radiology department offers CT diagnostics to both scheduled and unscheduled patients. Of these unscheduled patients, some must be seen immediately, while others may wait for some time. Herein a trade-off is sought between acceptable waiting times for appointment patients and unscheduled patients’ lateness. In this paper we use a discrete event simulation model to determine the performance of a given appointment schedule in terms of waiting time and lateness. Also we propose a constructive and local search heuristic that embeds this model and optimizes the schedule. For smaller instances, we verify the simulation model as well as compare our search heuristics’ performance with optimal schedules obtained using a Markov reward process. In addition we present computational results from the case study in the Dutch hospital. These results show that a considerable decrease of waiting time is possible for scheduled patients, while still treating unscheduled patients on time.",
keywords = "UT-Hybrid-D, Radiology, Service operations, Heuristics, Appointment scheduling",
author = "Borgman, {Nardo J.} and Vliegen, {Ingrid M.H.} and Boucherie, {Richard J.} and Hans, {Erwin W.}",
note = "Springer deal",
year = "2018",
month = "6",
doi = "10.1007/s10696-016-9268-0",
language = "English",
volume = "30",
pages = "30--53",
journal = "Flexible services and manufacturing journal",
issn = "1936-6582",
publisher = "Springer",
number = "1-2",

}

Appointment scheduling with unscheduled arrivals and reprioritization. / Borgman, Nardo J. (Corresponding Author); Vliegen, Ingrid M.H.; Boucherie, Richard J.; Hans, Erwin W.

In: Flexible services and manufacturing journal, Vol. 30, No. 1-2, 06.2018, p. 30-53.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Appointment scheduling with unscheduled arrivals and reprioritization

AU - Borgman, Nardo J.

AU - Vliegen, Ingrid M.H.

AU - Boucherie, Richard J.

AU - Hans, Erwin W.

N1 - Springer deal

PY - 2018/6

Y1 - 2018/6

N2 - Inspired by the real life problem of a radiology department in a Dutch hospital, we study the problem of scheduling appointments, taking into account unscheduled arrivals and reprioritization. The radiology department offers CT diagnostics to both scheduled and unscheduled patients. Of these unscheduled patients, some must be seen immediately, while others may wait for some time. Herein a trade-off is sought between acceptable waiting times for appointment patients and unscheduled patients’ lateness. In this paper we use a discrete event simulation model to determine the performance of a given appointment schedule in terms of waiting time and lateness. Also we propose a constructive and local search heuristic that embeds this model and optimizes the schedule. For smaller instances, we verify the simulation model as well as compare our search heuristics’ performance with optimal schedules obtained using a Markov reward process. In addition we present computational results from the case study in the Dutch hospital. These results show that a considerable decrease of waiting time is possible for scheduled patients, while still treating unscheduled patients on time.

AB - Inspired by the real life problem of a radiology department in a Dutch hospital, we study the problem of scheduling appointments, taking into account unscheduled arrivals and reprioritization. The radiology department offers CT diagnostics to both scheduled and unscheduled patients. Of these unscheduled patients, some must be seen immediately, while others may wait for some time. Herein a trade-off is sought between acceptable waiting times for appointment patients and unscheduled patients’ lateness. In this paper we use a discrete event simulation model to determine the performance of a given appointment schedule in terms of waiting time and lateness. Also we propose a constructive and local search heuristic that embeds this model and optimizes the schedule. For smaller instances, we verify the simulation model as well as compare our search heuristics’ performance with optimal schedules obtained using a Markov reward process. In addition we present computational results from the case study in the Dutch hospital. These results show that a considerable decrease of waiting time is possible for scheduled patients, while still treating unscheduled patients on time.

KW - UT-Hybrid-D

KW - Radiology

KW - Service operations

KW - Heuristics

KW - Appointment scheduling

U2 - 10.1007/s10696-016-9268-0

DO - 10.1007/s10696-016-9268-0

M3 - Article

VL - 30

SP - 30

EP - 53

JO - Flexible services and manufacturing journal

JF - Flexible services and manufacturing journal

SN - 1936-6582

IS - 1-2

ER -