Scheduling partially ordered jobs faster than 2^n

   Abstract