Robust Non-Clairvoyant Scheduling with Classification Models
DGX agentarXiv:2610.01343v1 Announce Type: new Abstract: We study the classical single-machine scheduling problem of minimizing the sum of completion times of jobs in a non-clairvoyant setting, where the proce