An approach using SAT solvers for the RCPSP with logical constraints
From MaRDI portal
Publication:321002
DOI10.1016/j.ejor.2015.08.044zbMath1346.90449OpenAlexW1867167597MaRDI QIDQ321002
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.08.044
Related Items
A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs, Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource, Resource leveling in projects with flexible structures, An updated survey of variants and extensions of the resource-constrained project scheduling problem, An effective heuristic for project scheduling with resource availability cost, Resource-constrained project scheduling with activity splitting and setup times, Stochastic project scheduling with hierarchical alternatives
Uses Software
Cites Work
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- A survey of variants and extensions of the resource-constrained project scheduling problem
- An iterative scheduling technique for resource-constrained project scheduling
- PSPLIB -- a project scheduling problem library
- Resource-constrained project scheduling: A survey of recent developments.
- Project scheduling. A research handbook.
- ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
- Justification and RCPSP: a technique that pays
- Resource-constrained project scheduling: Notation, classification, models, and methods
- An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances
- A hybrid genetic algorithm for the resource-constrained project scheduling problem
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
- GRASP: a search algorithm for propositional satisfiability
- Scheduling with AND/OR Precedence Constraints
- Scheduling Tasks with AND/OR Precedence Constraints
- A machine program for theorem-proving
- The complexity of theorem-proving procedures
- Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm
- A note on the paper Resource-constraint project scheduling: Notation, classification, models and methods by Bruckner et al