Fault-tolerant scheduling
From MaRDI portal
Publication:2817601
DOI10.1145/195058.195115zbMath1344.68038OpenAlexW2002345807MaRDI QIDQ2817601
Bala Kalyanasundaram, Kirk R. Pruhs
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195115
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Related Items (3)
On-line two-machine open shop scheduling with time lags ⋮ Scheduling with limited machine availability ⋮ Scheduling with unexpected machine breakdowns
This page was built for publication: Fault-tolerant scheduling