T is a thin category built from an acyclic prerequisite relation (a poset): objects are tasks, and there is a unique morphism x→y iff x ≤ y (“x is a prerequisite of y”).
S is the thin category of down-closed completion states (aka ideals/downsets): objects are sets of completed tasks that respect prerequisites; morphisms are inclusions I⊆J.
These states record completed tasks under precedence. For the additional question of who can work at the same time, Same work, different piles retains crew bundles, durations and resource availability. A downset here is not a full resource-and-time project state.
F: T→S sends each task x to its principal ideal ↓x: the minimal completed-state that “entails x”.
G: T→Arr(S) sends each task to an arrow-object (a transition) in the arrow category: pre(x) → pre(x)∪{x}, where pre(x)=↓x\{x}.
This is why we don’t need a 2-functor to map “tasks as objects” to “tasks as transitions”: we keep it well-typed by targeting Arr(S).