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

DOI10.1007/s10479-010-0693-2zbMath1209.90170OpenAlexW2057332688MaRDI QIDQ2430594

Andrei Horbach

Publication date: 8 April 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://www.econstor.eu/bitstream/10419/147562/1/manuskript_644.pdf

zbMATH Keywords

project managementpropositional satisfiabilityresource constraintscomplete algorithmsproduction-scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations, Major 2 Satisfiability Logic in Discrete Hopfield Neural Network, Solving RCPSP/max by lazy clause generation, A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints, meSAT: multiple encodings of CSP to SAT, Energetic reasoning for energy-constrained scheduling with a continuous resource

Uses Software

• MiniSat
• PSPLIB
• PBS
• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time transformation of linear inequalities into conjunctive normal form
• A constraint programming approach for the resource-constrained project scheduling problem
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• Project scheduling. A research handbook.
• Constraint propagation techniques for the disjunctive scheduling problem
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Tight LP bounds for resource constrained project scheduling
• Scattered branch and bound. An adaptive search strategy applied to resource-constrained project scheduling
• Another look at graph coloring via propositional satisfiability
• Conflict analysis in mixed integer programming
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
• A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
• Towards Robust CNF Encodings of Cardinality Constraints
• Model checking with Boolean Satisfiability
• Cardinality Networks and Their Applications
• New Encodings of Pseudo-Boolean Constraints into CNF
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Algorithmic approaches to preselective strategies for stochastic scheduling problems
• Constraint Propagation Based Scheduling of Job Shops
• Theory and Applications of Satisfiability Testing
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• The complexity of theorem-proving procedures
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• Principles and Practice of Constraint Programming – CP 2003