Disjunctive graph

Way of representing scheduling problems by showing the tasks and timing rules they must follow

In the mathematical modeling of job shop scheduling problems, disjunctive graphs are a way of modeling a system of tasks to be scheduled and timing constraints that must be respected by the schedule. They are mixed graphs, in which vertices may be connected by both directed and undirected edges. The two types of edges represent constraints of two different types:If one task x must be performed earlier than a second task y, this constraint is represented by a directed edge from x to y. If, on the other hand, two tasks x and y can be performed in either order, but not simultaneously, this non-simultaneity constraint is represented by an undirected edge connecting x and y.

This keyword could refer to multiple things. Here are some suggestions: