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

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 te...

Full description

Saved in:
Bibliographic Details
Published inAnnals of operations research Vol. 181; no. 1; pp. 89 - 107
Main Author Horbach, Andrei
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.12.2010
Springer Science + Business Media
Springer
Springer Nature B.V
Subjects
Algorithms
Boolean
Business and Management
Combinatorics
Methods
Operations research
Operations Research/Decision Theory
Optimization
Production scheduling
Project management
Renewable resources
Scheduling
Semiconductor industry
Studies
Theory of Computation
United States
Resource constraints
Propositional satisfiability
Complete algorithms
Project management
Production-scheduling
Online AccessGet full text
ISSN0254-5330
1572-9338
DOI10.1007/s10479-010-0693-2

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-010-0693-2