A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints

•An new exact method based on satisfiability and workload is proposed for the problem.•The proposed approach also performs well on instances of the classical version.•A number of open instances were solved for the first time.•Several improved bounds are reported for instances that still remain open.