Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem

@inproceedings{Anstegui2011SatisfiabilityMT,
  title={Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem},
  author={Carlos Ans{\'o}tegui and Miquel Bofill and Miquel Palah{\'i} and Josep Suy and Mateu Villaret},
  booktitle={SARA},
  year={2011}
}
The Resource-Constrained Project Scheduling Problem (RCPSP) and some of its extensions have been widely studied. Many approaches have been considered to solve this problem: constraint programming (CP), Boolean satisfiability (SAT), mixed integer linear programming (MILP), branch and bound algorithms (BB) and others. In this paper, we present a new approach for solving this problem: satisfiability modulo theories (SMT). Solvers for SMT generalize SAT solving by adding the ability to handle… CONTINUE READING