Appointment scheduling with discrete random durations

Authors:
Mehmet A. Begen;Maurice Queyranne
Affiliations:
University of British Columbia, Vancouver, BC, Canada;University of British Columbia, Vancouver, BC, Canada
Venue:
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Year:
2009

Citing 4
Cited 1

Submodular function minimization

Mathematical Programming: Series A and B
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
A faster strongly polynomial time algorithm for submodular function minimization

Mathematical Programming: Series A and B
On the Structure of Lost-Sales Inventory Models

Operations Research

Appointment Scheduling with Discrete Random Durations

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of determining optimal appointment schedule for a given sequence of jobs (e.g., medical procedures) on a single processor (e.g., operating room, examination facility), to minimize the expected total underage and overage costs when each job has a random processing duration given by a joint discrete probability distribution. Simple conditions on the cost rates imply that the objective function is submodular and L-convex. Then there exists an optimal appointment schedule which is integer and can be found in polynomial time. Our model can handle a given due date for the total processing (e.g., end of day for an operating room) after which overtime is incurred and, no-shows and emergencies.