A polynomial time algorithm for Zero-Clairvoyant scheduling

DOI10.1016/j.jal.2006.08.001zbMath1180.90140OpenAlexW2054059941MaRDI QIDQ2475435

K. Subramani and Vahan Mkrtchyan

Publication date: 11 March 2008

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2006.08.001

zbMATH Keywords

polytopefault-tolerancereal-time schedulingdispatching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Temporal constraint networks
• Scheduling real-time computations with separation constraints
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Parametric dispatching of hard real-time tasks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial time algorithm for Zero-Clairvoyant scheduling