A MinCumulative resource constraint
From MaRDI portal
Publication:2170208
DOI10.1007/978-3-031-08011-1_21zbMath1502.90077OpenAlexW4285182772MaRDI QIDQ2170208
Claude-Guy Quimper, Yanick Ouellet
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_21
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Explaining the \texttt{cumulative} propagator
- An efficient bounds consistency algorithm for the global cardinality constraint
- Complete bound consistency for the global cardinality constraint
- A linear-time algorithm for a special case of disjoint set union
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
- A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
- An annotated bibliography of personnel scheduling and rostering
- Propagation via lazy clause generation
- A quadratic edge-finding filtering algorithm for cumulative resource constraints
- Formal languages for integer programming modeling of shift scheduling problems
- The state of the art of nurse rostering
- 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
This page was built for publication: A MinCumulative resource constraint
