Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal

We study the design of a healthcare appointment system with a single physician and a group of patients whose service durations are stochastic. The challenge is to find the optimal arrival sequence for a group of mixed patients such that the expected total cost of patient waiting time and physician o...

Full description

Saved in:
Bibliographic Details
Main Authors: KONG, Qingxia, LEE, Chung-Yee, TEO, Chung-Piaw, ZHENG, Zhichao
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2016
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/4474
https://ink.library.smu.edu.sg/context/lkcsb_research/article/5473/viewcontent/Kong__Lee__Teo__Zheng__2016___Copyright__Appointment_sequencing___Why_the_smallest_variance_first_rule_may_not_be_optimal.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-5473
record_format dspace
spelling sg-smu-ink.lkcsb_research-54732020-01-27T08:48:49Z Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal KONG, Qingxia LEE, Chung-Yee TEO, Chung-Piaw ZHENG, Zhichao We study the design of a healthcare appointment system with a single physician and a group of patients whose service durations are stochastic. The challenge is to find the optimal arrival sequence for a group of mixed patients such that the expected total cost of patient waiting time and physician overtime is minimized. While numerous simulation studies report that sequencing patients by increasing order of variance of service duration (Smallest-Variance-First or SVF rule) performs extremely well in many environments, analytical results on optimal sequencing are known only for two patients. In this paper, we shed light on why it is so difficult to prove the optimality of the SVF rule in general. We first assume that the appointment intervals are fixed according to a given template and analytically investigate the optimality of the SVF rule. In particular, we show that the optimality of the SVF rule depends on two important factors: the number of patients in the system and the shape of service time distributions. The SVF rule is more likely to be optimal if the service time distributions are more positively skewed, but this advantage gradually disappears as the number of patients increases. These results partly explain why the optimality of the SVF rule can only be proved for a small number of patients, and why in practice, the SVF rule is usually observed to be superior, since most empirical distributions of the service durations are positively skewed, like log-normal distributions. The insights obtained from our analytical model apply to more general settings, including the cases where the service durations follow log-normal distributions and the appointment intervals are optimized. 2016-12-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/4474 info:doi/10.1016/j.ejor.2016.06.004 https://ink.library.smu.edu.sg/context/lkcsb_research/article/5473/viewcontent/Kong__Lee__Teo__Zheng__2016___Copyright__Appointment_sequencing___Why_the_smallest_variance_first_rule_may_not_be_optimal.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University OR in health services Appointment Sequencing Smallest-Variance-First Rule Stochastic Ordering Medicine and Health Sciences Operations and Supply Chain Management
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic OR in health services
Appointment Sequencing
Smallest-Variance-First Rule
Stochastic Ordering
Medicine and Health Sciences
Operations and Supply Chain Management
spellingShingle OR in health services
Appointment Sequencing
Smallest-Variance-First Rule
Stochastic Ordering
Medicine and Health Sciences
Operations and Supply Chain Management
KONG, Qingxia
LEE, Chung-Yee
TEO, Chung-Piaw
ZHENG, Zhichao
Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal
description We study the design of a healthcare appointment system with a single physician and a group of patients whose service durations are stochastic. The challenge is to find the optimal arrival sequence for a group of mixed patients such that the expected total cost of patient waiting time and physician overtime is minimized. While numerous simulation studies report that sequencing patients by increasing order of variance of service duration (Smallest-Variance-First or SVF rule) performs extremely well in many environments, analytical results on optimal sequencing are known only for two patients. In this paper, we shed light on why it is so difficult to prove the optimality of the SVF rule in general. We first assume that the appointment intervals are fixed according to a given template and analytically investigate the optimality of the SVF rule. In particular, we show that the optimality of the SVF rule depends on two important factors: the number of patients in the system and the shape of service time distributions. The SVF rule is more likely to be optimal if the service time distributions are more positively skewed, but this advantage gradually disappears as the number of patients increases. These results partly explain why the optimality of the SVF rule can only be proved for a small number of patients, and why in practice, the SVF rule is usually observed to be superior, since most empirical distributions of the service durations are positively skewed, like log-normal distributions. The insights obtained from our analytical model apply to more general settings, including the cases where the service durations follow log-normal distributions and the appointment intervals are optimized.
format text
author KONG, Qingxia
LEE, Chung-Yee
TEO, Chung-Piaw
ZHENG, Zhichao
author_facet KONG, Qingxia
LEE, Chung-Yee
TEO, Chung-Piaw
ZHENG, Zhichao
author_sort KONG, Qingxia
title Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal
title_short Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal
title_full Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal
title_fullStr Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal
title_full_unstemmed Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal
title_sort appointment sequencing: why the smallest-variance-first rule may not be optimal
publisher Institutional Knowledge at Singapore Management University
publishDate 2016
url https://ink.library.smu.edu.sg/lkcsb_research/4474
https://ink.library.smu.edu.sg/context/lkcsb_research/article/5473/viewcontent/Kong__Lee__Teo__Zheng__2016___Copyright__Appointment_sequencing___Why_the_smallest_variance_first_rule_may_not_be_optimal.pdf
_version_ 1770572260585766912