Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
Rafał Różycki, Grzegorz Waligóra, Jan Węglarz (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines) and continuous, it is generally called a discrete-continuous scheduling...