1 paper
Adrian Calinescu, Gruia Calinescu
We study the online busy time scheduling model on one machine of unbounded capacity, with non-preemptive jobs. In our setting, flexible jobs arrive online with a processing time an…