Complexity of the Project Sequencing Problem

This paper analyzes the computational complexity of the project sequencing problem. Specifically, we prove that the general decision problem is NP-complete, but note that an important special case is solvable in polynomial time.