ordproblem

Ordproblem is a term used in discrete mathematics and theoretical computer science to denote a family of problems that revolve around arranging elements into a total order under given constraints. In its most common form, ordproblem asks for a permutation of a finite set that respects a set of precedence relations, or to determine whether such a permutation exists.

Formally, given a finite set V and a relation P subset of V × V representing precedence constraints (x must come before y), an admissible order is a permutation π of V such that for every (x, y) in P, x appears before y in π. A solution is a linear extension of the partial order defined by P. Variants include counting the number of linear extensions, finding one feasible order, and optimizing an objective function defined over the order (for example minimizing total completion time or lateness).

Complexity and methods vary with structure. If the precedence graph defined by P is acyclic, a topological sort yields a feasible order in linear time O(|V| + |P|). Counting linear extensions is #P-complete, and many optimization variants are NP-hard in general. Special cases where the constraints form a tree, a series-parallel DAG, or other restricted structures may admit more efficient algorithms or exact solutions.

Applications of ordproblems appear in project scheduling, instruction or task scheduling in compilers and processors, data processing pipelines, and ranking or prioritization systems where a valid or optimal ordering is required under precedence constraints. Related concepts include linear extensions, posets, and topological sort.

See also: linear extension, topological sort, poset, scheduling, ordering problems.