Robust Appointment Scheduling for General Convex Uncertainty Sets
The Appointment Scheduling Problem (ASP) involves scheduling a finite number of customers with uncertain service times, served consecutively by a single server, with the goal of minimizing the weighted costs of waiting time, idle time, and overtime. Previous studies employing stochastic programming were limited to small instances or constrained by restrictive assumptions. We introduce a … Read more