An approach using SAT solvers for the RCPSP with logical constraints
From MaRDI portal
(Redirected from Publication:321002)
Recommendations
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
- A constraint integer programming approach for resource-constrained project scheduling
- Using constraint programming for solving RCPSP/MAX-cal
Cites work
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
- A hybrid genetic algorithm for the resource-constrained project scheduling problem
- A machine program for theorem-proving
- A note on the paper Resource-constraint project scheduling: Notation, classification, models and methods by Bruckner et al
- A survey of variants and extensions of the resource-constrained project scheduling problem
- An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances
- An iterative scheduling technique for resource-constrained project scheduling
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- GRASP: a search algorithm for propositional satisfiability
- Justification and RCPSP: a technique that pays
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- PSPLIB -- a project scheduling problem library
- ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
- Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm
- Project scheduling. A research handbook.
- Resource-constrained project scheduling: A survey of recent developments.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Scheduling Tasks with AND/OR Precedence Constraints
- Scheduling with AND/OR Precedence Constraints
- The complexity of theorem-proving procedures
Cited in
(11)- Stochastic project scheduling with hierarchical alternatives
- A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a Boolean satisfiability solver
- Resource-constrained project scheduling with activity splitting and setup times
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs
- An effective heuristic for project scheduling with resource availability cost
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- raSAT: An SMT Solver for Polynomial Constraints
- Resource leveling in projects with flexible structures
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
This page was built for publication: An approach using SAT solvers for the RCPSP with logical constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q321002)