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

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

0.00 Avg rating0 Votes
Article ID: iaor20108889
Volume: 181
Issue: 1
Start Page Number: 89
End Page Number: 107
Publication Date: Dec 2010
Journal: Annals of Operations Research
Authors:
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.

Reviews

Required fields are marked *. Your email address will not be published.