As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
In this paper we present a system for solving the Resource-Constrained Project Scheduling Problem (RCPSP) by means of reformulation into SMT. We extend previous results to RCPSP/max, where maximum delays between tasks are considered in addition to minimum delays. We also present a tool for easy modeling and solving of RCPSP/max instances, which allows a graphical representation of the solution obtained. The system is modular in the sense that new solvers, not necessarily based on SMT, can be plugged-in as external executables.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.