This article discusses techniques that aim at reducing the effective size of the search space to be explored in order to find a satisfactory solution.

Specifically, we study a class of job shop scheduling problems in which operations have to be performed within non-relaxable time windows [Sadeh 89a, Fox 89, ...

Our study suggests that a key to defining these more powerful heuristics lies in the ability of the probabilistic framework to provide estimates of the reliance ...

Specifically, we study a class of job shop scheduling problems in which operations have to be performed within non-relaxable time windows [Sadeh 89a, Fox 89, ...

The authors introduce new heuristics for ordering the choices in the search for a feasible solution to a job shop constraint (JSC) scheduling problem.

We view the scheduling problem as a constraint satisfaction problem (CSP). The variables of the problem are the activity start times, and the resources ...

Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems.Steven Minton, Mark D. Johnston, Andrew B. Philips ...

This paper addresses the issue of how to generate advice to decide which variable to instantiate next i.e. variable ordering heuristics, and which value to ...

Variable and value ordering heuristics for hard constraint satisfaction problems: an application to job shop scheduling.

Sadeh N., Fox M. W. Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem // Artificial Intelligence. 1996. Vol. 86 ...