Robust Non-Clairvoyant Scheduling with Classification Models

Anthony Dugois, Vincent Fagnon, Giorgio Lucarelli

We study the classical single-machine scheduling problem of minimizing the sum of completion times of jobs in a non-clairvoyant setting, where the processing time of each job remai…