We consider an online version of the classical problem of preemptive scheduling on uniformly related machines.
