Scheduling Interval Orders in Parallel

Interval orders are partial orders defined by having interval representations. It is well known that a transitively oriented digraph G is an interval order iff its (undirected) complement G is chordal. We investigate parallel algorithms for the following scheduling problem: Given a system consisting of a set T of n tasks (each requiring unit execution time) and an interval order OE over T , and given m identical parallel processors, construct an optimal (i.e., minimal length) schedule for (T ; OE). Ou