Resource constrained project scheduling with general precedence relations optimized with SAT

Abstract

This paper presents an approach, based on propositional satisfiability (SAT), for the resource constrained project scheduling problem with general precedence relations. This approach combines propositional satisfiability formulations with a bisection method, in order to achieve an optimal solution. The empirical results suggest that when the optimal schedule is significantly affected by the availability of resources, this strategy outperforms the typical integer linear programming approach.