Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5139168 (Why is no real title available?)
- scientific article; zbMATH DE number 3325539 (Why is no real title available?)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
- A New Look at BDDs for Pseudo-Boolean Constraints
- A constraint integer programming approach for resource-constrained project scheduling
- A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a Boolean satisfiability solver
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- A matheuristic for 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 scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows
- A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Activity nets: A guided tour through some recent developments
- An analysis of network and resource indicators for resource-constrained project scheduling problem instances
- An approach using SAT solvers for the RCPSP with logical constraints
- An evaluation of the adequacy of project network generators with systematically sampled networks
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Complex Scheduling
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Explaining the \texttt{cumulative} propagator
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Going to the core of hard resource-constrained project scheduling instances
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- New Encodings of Pseudo-Boolean Constraints into CNF
- New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms
- On CNF encodings of decision diagrams
- On maximizing the net present value of a project under renewable resource constraints
- On the summary measures for the resource-constrained project scheduling problem
- PSPLIB -- a project scheduling problem library
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Project scheduling. A research handbook.
- Propagation via lazy clause generation
- Reducing the feasible solution space of resource-constrained project instances
- Resource-constrained project scheduling with activity splitting and setup times
- Resource-constrained project scheduling: A survey of recent developments.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- Solving RCPSP/max by lazy clause generation
This page was built for publication: Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855217)
