A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
From MaRDI portal
Publication:2029253
DOI10.1016/j.ejor.2019.07.056zbMath1487.90285OpenAlexW2965695689MaRDI QIDQ2029253
Anand Subramanian, Guilherme Henrique Ismael de Azevedo, Artur Alves Pessoa
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.056
Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Explaining the \texttt{cumulative} propagator
- Event-based MILP models for resource-constrained project scheduling problems
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- Scheduling subject to resource constraints: Classification and complexity
- An almost optimal algorithm for unbounded searching
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Tight LP bounds for resource constrained project scheduling
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Solving RCPSP/max by lazy clause generation
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem
- Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
- Solving Project Scheduling Problems by Minimum Cut Computations
- Critical-Path Planning and Scheduling: Mathematical Basis
- GRASP: a search algorithm for propositional satisfiability
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
- Theory and Applications of Satisfiability Testing
- A Computing Procedure for Quantification Theory
- Scheduling projects with labor constraints
This page was built for publication: A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
