Chromatic scheduling of dedicated 2-processor UET tasks to minimize mean flow time

Investigates the computational complexity of scheduling of biprocessor tasks on dedicated processors from a mean flow time point of view. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of scheduling graphs. In this way we identify a number of special cases that are either NP-hard or polynomially solvable.