In last-mile routing, the task of finding a route is often framed as a Traveling Salesman Problem to minimize travel time and associated cost. However, solutions stemming from this approach do not match the realized paths as drivers deviate due to navigational considerations and preferences. To...

Appointment schedules in essence balance supply and demand and are often employed in settings where resources are scarce and thus a high utilization is realized, e.g. healthcare. Whereas most of the existing literature focuses on the single-server case, a framework is developed to study...

We study appointment scheduling problems in continuous time. A finite number of clients are scheduled such that a function of the waiting time of clients, the idle time of the server, and the lateness of the schedule is minimized. The optimal schedule is notoriously hard to derive within...