Robust convex optimization – Optimization Online

Robust Appointment Scheduling for General Convex Uncertainty Sets

Published: 2024/09/25, Updated: 2026/06/11

Applications - OR and Management Sciences, Robust Optimization, Scheduling appointment scheduling, Computational tractability, Convex uncertainty sets, cutting-set methods, Reformulation-perspectification techniques, Robust convex optimization, robust optimization

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, which can be written as a sum-of-max linear functions. We introduce a novel robust optimization approach that considers … Read more