- Optimal stationary appointment schedules
- Operations Research Letters
- Volume | Issue number
- 45 | 6
- Pages (from-to)
- Document type
- Faculty of Economics and Business (FEB)
Faculty of Science (FNWI)
- Amsterdam Business School Research Institute (ABS-RI)
Korteweg-de Vries Institute for Mathematics (KdVI)
A prevalent operations research problem concerns the generation of appointment schedules that effectively deal with variation in e.g. service times. In this paper we focus on the situation in which there is a large number of statistically identical customers, leading to an essentially equidistant ('stationary') schedule. We develop a powerful approach that minimizes an objective function incorporating the service provider's idle times and the customers' waiting times. Our main results concern easily computable, or even closed-form, approximations to the optimal schedule with a near-perfect fit. In addition, accurate explicit heavy-traffic approximations are provided, which, as we argue, can be considered as robust.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.