Local search with constraint propagation and conflict-based heuristics

DOI10.1016/S0004-3702(02)00221-7zbMath1015.68056OpenAlexW2095435811MaRDI QIDQ1606115

Narendra Jussien, Olivier Lhomme

Publication date: 31 July 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00221-7

zbMATH Keywords

local searchconstraint satisfactionconflict-based searchhybrid search algorithmrepair methods

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

Compiling finite linear CSP into SAT, Identifying and exploiting problem structures using explanation-based constraint programming, Heuristic-based backtracking relaxation for propositional satisfiability, Space and time allocation in a shipyard assembly hall, The Relation Between Complete and Incomplete Search, Explaining the \texttt{cumulative} propagator, Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire, About the choice of the variable to unassign in a decision repair algorithm, Four decades of research on the open-shop scheduling problem to minimize the makespan, Exploiting relaxation in local search for LABS, Integrating operations research in constraint programming, Shift-and-propagate, Exploring relaxation induced neighborhoods to improve MIP solutions, Switching among Solvers: Collaborative Algorithms with Parameter Control, Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem, Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes, Explanation-based large neighborhood search, Constraint solving in uncertain and dynamic environments: A survey

Uses Software

• JOBSHOP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint propagation with interval labels
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Consistency in networks of relations
• A tabu search algorithm for the open shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• A branch \(\&\) bound algorithm for the open-shop problem
• A tabu search algorithm for the open shop problem
• Competitive genetic algorithms for the open-shop scheduling problem
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
• A new lower bound for the open-shop problem
• Benchmarks for basic scheduling problems
• A Computational Study of the Job-Shop Scheduling Problem
• Open Shop Scheduling to Minimize Finish Time