1 paper
Christoph Damerius, Peter Kling, Florian Schneider
We consider the following shared-resource scheduling problem: Given a set of jobs J, for each j∈J we must schedule a job-specific processing volume of vj>0. A total resou…