Performance of the smallest-variance-first rule in appointment sequencing

MA De Kemp, M Mandjes, N Olver - Operations Research, 2021 - pubsonline.informs.org
A classic problem in appointment scheduling with applications in healthcare concerns the
determination of the patients' arrival times that minimize a cost function that is a weighted
sum of mean waiting times and mean idle times. One aspect of this problem is the
sequencing problem, which focuses on ordering the patients. We assess the performance of
the smallest-variance-first (SVF) rule, which sequences patients in order of increasing
variance of their service durations. Although it is known that SVF is not always optimal, it has …

[PDF][PDF] Performance of the smallest-variance-first rule in appointment sequencing LSE Research Online URL for this paper: http://eprints. lse. ac. uk/104585

MA de Kemp, M Mandjes, N Olver - core.ac.uk
A classical problem in appointment scheduling, with applications in health care, concerns
the determination of the patients' arrival times that minimize a cost function that is a weighted
sum of mean waiting times and mean idle times. One aspect of this problem is the
sequencing problem, which focuses on ordering the patients. We assess the performance of
the smallest-variance-first (sVF) rule, which sequences patients in order of increasing
variance of their service durations. While it is known that sVF is not always optimal, it has …
以上显示的是最相近的搜索结果。 查看全部搜索结果