Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT

  title={Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with SMT},
  author={Miquel Bofill and Jordi Coll and Josep Suy and Mateu Villaret},
  journal={2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)},
The Multi-Mode Resource-Constrained Project Scheduling Problem (MRCPSP) is a generalization of the well known Resource-Constrained Project Scheduling Problem (RCPSP). The most common exact approaches for solving this problem are based on branch-and-bound algorithms, mixed integer linear programming and Boolean satisfiability (SAT). In this paper, we present a new exact approach for solving this problem, using Satisfiability Modulo Theories (SMT). We provide two encodings into SMT and several… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 25 references

A new approach to minimize the makespan of various resource-constrained project scheduling problems

J. Coelho, M. Vanhoucke
Proceedings of the 14th International Conference on Project Management and Scheduling. TUM School of Management, 2014, pp. 1–4. • 2014
View 8 Excerpts
Highly Influenced

PSPLIB - A Project Scheduling Problem Library

R. Kolisch, A. Sprecher
European Journal of Operational Research, vol. 96, no. 1, pp. 205–216, 1997. • 1997
View 4 Excerpts
Highly Influenced

Yices 2.2

CAV • 2014
View 2 Excerpts

Resource-constrained project scheduling: models, algorithms, extensions and applications

C. Artigues, S. Demassey, E. Neron
View 1 Excerpt

A new look at bdds for pseudo-boolean constraints

I. Abı́o, R. Nieuwenhuis, A. Oliveras, E. Rodrı́guez-Carbonell, V. Mayer-Eichberger
Journal of Artificial Intelligence Research, pp. 443–480, 2012. • 2012
View 1 Excerpt

Similar Papers

Loading similar papers…