In an online scheduling algorithm for a dynamically unfolding DAG, the scheduling decision at each step is based on only the revealed nodes and edges of the DAG.
Only the root nodes are revealed, and the algorithm must detect when new nodes are revealed in order to schedule them.