Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
From MaRDI portal
Publication:1617387
DOI10.1007/s10601-018-9282-9zbMath1457.90067OpenAlexW2801887155WikidataQ129997431 ScholiaQ129997431MaRDI QIDQ1617387
Yanick Ouellet, Hamed Fahimi, Claude-Guy Quimper
Publication date: 8 November 2018
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11794/21641
Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
- Benchmarks for basic scheduling problems
- A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)
- Solving RCPSP/max by lazy clause generation
- Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
- Max Energy Filtering Algorithm for Discrete Cumulative Resources
- Some simple scheduling algorithms
- A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Time-Table Disjunctive Reasoning for the Cumulative Constraint
- Principles and Practice of Constraint Programming – CP 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
