Preprint
Aug 2026
On Randomized Online Span Minimization
We study the online Busy Time scheduling model on a single machine of unbounded capacity, with non-preemptive jobs. In our setting, flexible jobs arrive online with a processing time and deadline, both of which become known to the algorithm at the job's arrival time. The goal is to schedule jobs on the machine to finis...
A. Calinescu, G. Călinescu, Peng-Jun Wan
· 0 citations