Optimized appointment scheduling
We present an approach to compute optimized appointment schedules. The technique sequentially minimizes risk in terms of waiting time and service time. The technique applies to any convex loss function and service time distribution. We indicate that the approach is able to cover real-life phenomena such as no-shows. We demonstrate the approach by three representative examples.
appointment scheduling utility functions queues