An analysis of totally clairvoyant scheduling

DOI10.1007/s10951-005-6367-2zbMath1154.90493OpenAlexW2089112886MaRDI QIDQ2464437

K. Subramani and Vahan Mkrtchyan

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-6367-2

zbMATH Keywords

real-time systemsperformance metricsmutable dynamic programmingtotal clairvoyance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Empirical analysis of algorithms for the shortest negative cost cycle problem ⋮ Optimal length resolution refutations of difference constraint systems ⋮ Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm ⋮ On the negative cost girth problem in planar networks ⋮ Improved algorithms for optimal length resolution refutation in difference constraint systems ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ On quantified linear implications ⋮ On memoryless provers and insincere verifiers

Cites Work

• Online algorithms. The state of the art
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parametric dispatching of hard real-time tasks
• Fault-tolerant real-time scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item