Preemptive scheduling with variable profile, precedence constraints and due dates
Discrete Applied Mathematics
A Level Algorithm for Preemptive Scheduling
Journal of the ACM (JACM)
Scheduling preemptable tasks on parallel processors with limited availability
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Scheduling with unexpected machine breakdowns
Discrete Applied Mathematics
Optimal scheduling of independent tasks on heterogeneous computing systems
ACM '74 Proceedings of the 1974 annual conference - Volume 1
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
| Hi-index | 0.89 |
We study the problem of minimizing the makespan on related machines in the following setting: jobs arrive over time, and the machines may become available or unavailable. In either case, advance warning is given, i.e., the next point of time where a job is released or a machine changes state is revealed a little time ahead. We present an optimal online algorithm for this problem.