Publication Type

Working Paper

Publication Date

12-2016

Abstract

We consider a new model of appointment scheduling where customers are given the earliest possible appointment times under the service level constraint that the expected waiting time of each individual customer cannot exceed a given threshold. We apply the theory of majorization to analytically characterize the structure of the optimal appointment schedule. We show that, the optimal inter-appointment times increase with the order of arrivals. That is, the optimal inter-arrival time between two customers later in the arrival process is longer than that between two customers earlier in the arrival process. We study the limiting behavior of our system, and prove that, when customer service times follow an exponential distribution, our system converges asymptotically to the D/M/1 queueing system as the number of arrivals approaches infinity. We also extend our analysis to systems with multiple servers.

Keywords

Appointment scheduling; Service level constraint; Waiting time; Majorization

Discipline

Business Administration, Management, and Operations

Research Areas

Operations Management

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Share

COinS