The new algorithm shows that the scheduling instance is NP-easy, so with access to an appropriate NP oracle a deterministic Turing machine can solve it in polynomial time.