A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a Boolean satisfiability solver
From MaRDI portal
Publication:6565426
DOI10.1016/J.EJOR.2024.02.041MaRDI QIDQ6565426
José Coelho, Mario Vanhoucke, Tom Servranckx
Publication date: 2 July 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Scheduling resource-constrained projects with a flexible project structure
- An approach using SAT solvers for the RCPSP with logical constraints
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
- Explaining the \texttt{cumulative} propagator
- An iterative scheduling technique for resource-constrained project scheduling
- Resource-constrained project scheduling: A critical activity reordering heuristic
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs
- Justification and RCPSP: a technique that pays
- Resource-constrained project scheduling with activity splitting and setup times
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Stochastic project scheduling with hierarchical alternatives
- Multimode resource-constrained project scheduling in flexible projects
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Solving RCPSP/max by lazy clause generation
- A hybrid genetic algorithm for the resource-constrained project scheduling problem
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
This page was built for publication: A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a Boolean satisfiability solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565426)