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

An exact method for a class of robust nonlinear optimization problems

We introduce a novel exact approach for addressing a broad spectrum of optimization problems with robust nonlinear constraints. These constraints are defined as sums of products of linear times concave (SLC) functions with respect to the uncertain parameters. Our approach synergizes a cutting set method with reformulation-perspectification techniques and branch and bound. We further extend … Read more