A Boolean satisfiability approach to the resource-constrained project scheduling problem

28Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We formulate the resource-constrained project scheduling problem as a satisfiability problem and adapt a satisfiability solver for the specific domain of the problem. Our solver is lightweight and shows good performance both in finding feasible solutions and in proving lower bounds. Our numerical tests allowed us to close several benchmark instances of the RCPSP that have never been closed before by proving tighter lower bounds and by finding better feasible solutions. Using our method we solve optimally more instances of medium and large size from the benchmark library PSPLIB and do it faster compared to any other existing solver. © 2010 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Horbach, A. (2010). A Boolean satisfiability approach to the resource-constrained project scheduling problem. Annals of Operations Research, 181(1), 89–107. https://doi.org/10.1007/s10479-010-0693-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free