Scheduling with semaphore constraints (Q1096534)

We consider task systems with semaphore constraints, a generalization of the standard deterministic scheduling model that allows a broad class of task dependencies. We show that minimum length scheduling of task systems with semaphore constraints is NP-complete on two processors even when the tasks have identical execution times. In addition, we provide a linear time algorithm for determining the consistency of a task system with semaphore constraints.