Arc-B-consistency of the inter-distance constraint
From MaRDI portal
Publication:879973
DOI10.1007/s10601-006-9009-1zbMath1118.68156OpenAlexW1977520895MaRDI QIDQ879973
Konstantin Artiouchine, Philippe Baptiste
Publication date: 10 May 2007
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-006-9009-1
Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Properties of optimal schedules in preemptive shop scheduling
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Adjustment of heads and tails for the job-shop problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- On not-first/not-last conditions in disjunctive scheduling
- Accelerating filtering techniques for numeric CSPs
- Runway sequencing with holding patterns
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- A Computational Study of the Job-Shop Scheduling Problem
- Computational Complexity of Discrete Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Solving the open shop scheduling problem
This page was built for publication: Arc-B-consistency of the inter-distance constraint