Charles Explorer logo
🇬🇧

Online Preemptive Scheduling on Parallel Machines

Publication at Faculty of Mathematics and Physics |
2015

Abstract

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