An analysis of partially Clairvoyant scheduling

DOI10.1023/A:1024930227883zbMath1033.90044OpenAlexW1482467418MaRDI QIDQ1405819

K. Subramani and Vahan Mkrtchyan

Publication date: 7 September 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024930227883

zbMATH Keywords

real timetiming constraintsexecution time variabilitypartial clairvoyance

Mathematics Subject Classification ID

2-person games (91A05) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Out of order quantifier elimination for standard quantified linear programs ⋮ On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers ⋮ On quantified linear implications ⋮ An empirical analysis of algorithms for partially Clairvoyant scheduling

This page was built for publication: An analysis of partially Clairvoyant scheduling