Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited
From MaRDI portal
Publication:2677344
DOI10.1007/s43069-022-00172-6zbMath1505.90052OpenAlexW3169568093MaRDI QIDQ2677344
Sévérine Betmbe Fetgo, Clémentin Tayou Djamegni
Publication date: 13 January 2023
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-022-00172-6
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Event-based MILP models for resource-constrained project scheduling problems
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- On linear lower bounds for the resource constrained project scheduling problem.
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem
- Time table edge finding with energy variables
- A quadratic edge-finding filtering algorithm for cumulative resource constraints
- A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)
- Edge Finding for Cumulative Scheduling
- Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
- Time-Table Disjunctive Reasoning for the Cumulative Constraint
- Benchmarking optimization software with performance profiles.
This page was built for publication: Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited