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

  title={Performance of the smallest-variance-first rule in appointment sequencing},
  author={Madelon A. de Kemp and Michel Mandjes and Neil Olver},
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 was… Expand
Sequencing and Scheduling Appointments on Multiple Servers with Stochastic Service Durations and Customer Arrivals
  • Xueqi Wu, Shenghai Zhou
  • Computer Science
  • 2022
Computational results reveal that variations in service durations and fluctuations as well as customer unpunctual times have significant impacts on the system performance, while optimizing appointment sequencing decision can help reduce operational cost. Expand
Dynamic Appointment Scheduling
This paper considers appointment scheduling in a setting in which at every client arrival the schedule of all future clients can be adapted. Starting our analysis with an explicit treatment of theExpand


Appointment Sequencing: Why the Smallest-Variance-First Rule May Not Be Optimal
It is shown 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, and this advantage gradually disappears as the numberof patients increases. Expand
A Computational approach to optimized appointment scheduling
It is demonstrated that by using the phase-type counterparts of the service-time distributions, it is feasible to efficiently determine an optimized schedule, that is, to obtain accurate results with low computational effort. Expand
A Sequential Bounding Approach for Optimal Appointment Scheduling
This study exploits the problem structure to derive upper bounds that are independent of job duration distribution type and presents new analytical insights into the problem as well as a series of numerical experiments that illustrate properties of the optimal solution with respect to distribution type, cost structure, and number of jobs. Expand
Appointment Scheduling with Limited Distributional Information
In this paper, we develop distribution-free models that solve the appointment sequencing and scheduling problem by assuming only moments information of job durations. We show that our min--maxExpand
Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
A practical appointment schedule at an eye clinic that can significantly improve the efficiency of the appointment system in the clinic, compared to an existing schedule is developed. Expand
Optimal Policy for a Stochastic Scheduling Problem with Applications to Surgical Scheduling
We consider the stochastic, single-machine earliness/tardiness problem (SET), with the sequence of processing of the jobs and their due-dates as decisions and the objective of minimizing the sum ofExpand
Appointment Scheduling with Discrete Random Durations
This model can handle a given due date for the total processing of a given sequence of jobs after which overtime is incurred and, no-shows and emergencies. Expand
Optimized appointment scheduling
The proposed procedure for determining appointment schedules in a D/G/1-type of system by sequentially minimizing the per-customer expected loss provides schedules for any convex loss function and for the practically relevant cases of the quadratic and absolute value loss functions appealing closed-form results are derived. Expand
Using client-variance information to improve dynamic appointment scheduling performance
In this study, a more realistic, dynamic appointment-scheduling environment is developed and used to analyze several scheduling rules, showing that rules using client-variance information are still best at minimizing waiting time and idle time with the additional complexities. Expand
Robust Appointment Scheduling
This work analyzes the appointment scheduling problem from a robust-optimization perspective, and establishes the existence of a closed-form optimal solution--arguably the simplest and best `heuristic' possible. Expand