Single-Machine Scheduling with Interval Predictions and Costly Preemption

Lachlan Bridges

We study the single-machine total-completion-time problem $1||\sum C_j$ when processing times are unknown but each job comes with a reported interval. Jobs are initially processed…