Technical Note---A Sampling-Based Approach to Appointment Scheduling

Authors:
Mehmet A. Begen;Retsef Levi;Maurice Queyranne
Affiliations:
Ivey School of Business, University of Western Ontario, London, Ontario N6A 3K7, Canada;Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts, 02139;Sauder School of Business, University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada
Venue:
Operations Research
Year:
2012

Citing 4
Cited 0

Stochastic programming approach to optimization under uncertainty

Mathematical Programming: Series A and B
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models

Mathematics of Operations Research
All of Statistics: A Concise Course in Statistical Inference

All of Statistics: A Concise Course in Statistical Inference
Appointment Scheduling with Discrete Random Durations

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of appointment scheduling with discrete random durations but under the more realistic assumption that the duration probability distributions are not known and only a set of independent samples is available, e.g., historical data. For a given sequence of appointments (jobs, tasks), the goal is to determine the planned starting time of each appointment such that the expected total underage and overage costs due to the mismatch between allocated and realized durations is minimized. We use the convexity and subdifferential of the objective function of the appointment scheduling problem to determine bounds on the number of independent samples required to obtain a provably near-optimal solution with high probability.