1 paper
Adrian Calinescu, Gruia Calinescu, Peng-Jun Wan
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 ti…