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

[1]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[2]  V. Maniezzo,et al.  An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .

[3]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[4]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[5]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

[6]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[7]  Bart Selman,et al.  Satisfiability Solvers , 2008, Handbook of Knowledge Representation.

[8]  Philippe Michelon,et al.  A constraint programming approach for the resource-constrained project scheduling problem , 2007, Ann. Oper. Res..

[9]  Franz Josef Radermacher,et al.  Algorithmic approaches to preselective strategies for stochastic scheduling problems , 1983, Networks.

[10]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[11]  Willy Herroelen,et al.  Project Scheduling—Theory and Practice , 2005 .

[12]  Armin Scholl,et al.  Scattered branch and bound: an adaptive search strategy applied to resource-constrained project scheduling , 1998 .

[13]  Erwin Pesch,et al.  Constraint propagation techniques for the disjunctive scheduling problem , 2000, Artif. Intell..

[14]  Mario Vanhoucke,et al.  A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem , 2007, Oper. Res..

[15]  Arno Sprecher,et al.  Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements , 2000 .

[16]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[17]  Olivier Bailleux,et al.  Full CNF Encoding: The Counting Constraints Case , 2004, SAT.

[18]  Parosh Aziz Abdulla,et al.  Symbolic Reachability Analysis Based on SAT-Solvers , 2000, TACAS.

[19]  Allen Van Gelder,et al.  Another look at graph coloring via propositional satisfiability , 2008, Discret. Appl. Math..

[20]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[21]  Ulrich A. W. Tetzlaff,et al.  Constraint Propagation Based Scheduling of Job Shops , 1996, INFORMS J. Comput..

[22]  Peter Brucker,et al.  A branch and bound algorithm for the resource-constrained project scheduling problem , 1998, Eur. J. Oper. Res..

[23]  Joost P. Warners,et al.  A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form , 1998, Inf. Process. Lett..

[24]  Joao Marques-Silva,et al.  Model checking with Boolean Satisfiability , 2008, J. Algorithms.

[25]  Peter Brucker,et al.  A linear programming and constraint propagation-based lower bound for the RCPSP , 2000, Eur. J. Oper. Res..

[26]  K. Sakallah,et al.  Generic ILP versus specialized 0-1 ILP: an update , 2002, ICCAD 2002.

[27]  Erik Demeulemeester,et al.  New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .

[28]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[29]  U. Dorndorf,et al.  A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints , 2000 .

[30]  Olivier Bailleux,et al.  Efficient CNF Encoding of Boolean Cardinality Constraints , 2003, CP.

[31]  Olivier Roussel,et al.  New Encodings of Pseudo-Boolean Constraints into CNF , 2009, SAT.

[32]  Albert Oliveras,et al.  Cardinality Networks and Their Applications , 2009, SAT.

[33]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[34]  Tobias Achterberg,et al.  Conflict analysis in mixed integer programming , 2007, Discret. Optim..

[35]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[36]  Ian P. Gent.  Arc Consistency in SAT , 2002, ECAI.

[37]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[38]  Erwin Pesch,et al.  A branch-and-bound algorithm for the resource-constrained project scheduling problem , 2000, Math. Methods Oper. Res..

[39]  Armin Scholl,et al.  Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling , 1999, Eur. J. Oper. Res..

[40]  Inês Lynce,et al.  Towards Robust CNF Encodings of Cardinality Constraints , 2007, CP.

[41]  Philippe Baptiste,et al.  Tight LP bounds for resource constrained project scheduling , 2004, OR Spectr..

[42]  Franz Josef Radermacher,et al.  Preselective strategies for the optimization of stochastic project networks under resource constraints , 1983, Networks.

[43]  Dirk Briskorn,et al.  A Survey of Deterministic Modeling Approaches for Project Scheduling under Resource Constraints , 2008 .

[44]  Roberto Sebastiani,et al.  Lazy Satisability Modulo Theories , 2007, J. Satisf. Boolean Model. Comput..