In this thesis, the Systematic Local Search, a hybrid search method previously developed in [18] for constraint satisfaction problems, is extended for optimization problems especially in the constraint-based scheduling domain. Also in [10], a novel nogood definition (a nogood is a set of variable assignments that is precluded from any solution to the problem) is proposed as to induce nogoods on the precedence relations of the critical path and a proof demonstrates that this nogood definition captures the optimization criterion and is sound with respect to resolution in search. We evaluate the effectiveness of this extension on the benchmark job shop scheduling problems. Experimental results show that Systematic Local Search outperforms conv...
We propose a solution technique for schedul-ing and constraint satisfaction problems that combines b...
Local search techniques like simulated annealing and tabu search are based on a neighborhood structu...
The paper reports the results from a number of experiments on local search algorithms applied to job...
We survey solution methods for the job shop scheduling problem with an emphasis on local search. We ...
Abstract The meta-heuristic algorithm with local search is an excellent choice for the job-shop sche...
We present a computational performance analysis of local search algorithms for job shop scheduling. ...
[[abstract]]Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into o...
Abstract:- In this paper we present a hybrid method, named Quasi Local Search, which combines Simula...
International audienceEven though a very large number of solution methods has been developed for the...
Algorithms for solving constraint satisfcation problems (CSP) have been successfully applied to seve...
AbstractSearch algorithms for solving csp (Constraint Satisfaction Problems) usually fall into one o...
Rapid globalization over the past few years is leading to intense competition among manufacturers th...
AbstractLocal search techniques like simulated annealing and tabu search are based on a neighborhood...
AbstractPractical constraint satisfaction problems (CSPs) such as design of integrated circuits or s...
This paper presents three techniques for using an iter-ated local search algorithm to improve the pe...
We propose a solution technique for schedul-ing and constraint satisfaction problems that combines b...
Local search techniques like simulated annealing and tabu search are based on a neighborhood structu...
The paper reports the results from a number of experiments on local search algorithms applied to job...
We survey solution methods for the job shop scheduling problem with an emphasis on local search. We ...
Abstract The meta-heuristic algorithm with local search is an excellent choice for the job-shop sche...
We present a computational performance analysis of local search algorithms for job shop scheduling. ...
[[abstract]]Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into o...
Abstract:- In this paper we present a hybrid method, named Quasi Local Search, which combines Simula...
International audienceEven though a very large number of solution methods has been developed for the...
Algorithms for solving constraint satisfcation problems (CSP) have been successfully applied to seve...
AbstractSearch algorithms for solving csp (Constraint Satisfaction Problems) usually fall into one o...
Rapid globalization over the past few years is leading to intense competition among manufacturers th...
AbstractLocal search techniques like simulated annealing and tabu search are based on a neighborhood...
AbstractPractical constraint satisfaction problems (CSPs) such as design of integrated circuits or s...
This paper presents three techniques for using an iter-ated local search algorithm to improve the pe...
We propose a solution technique for schedul-ing and constraint satisfaction problems that combines b...
Local search techniques like simulated annealing and tabu search are based on a neighborhood structu...
The paper reports the results from a number of experiments on local search algorithms applied to job...