A Mixed Closure-CSP Method to Solve Scheduling Problems

Authors:
María Isabel Alfonso Galipienso;Federico Barber Sanchís
Affiliations:
-;-
Venue:
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Year:
2001

Citing 12
Cited 1

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Look-ahead techniques for micro-opportunistic job shop scheduling

Look-ahead techniques for micro-opportunistic job shop scheduling
From local to global consistency

Artificial Intelligence
Improved CLP scheduling with task intervals

Proceedings of the eleventh international conference on Logic programming
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem

Artificial Intelligence
On-line algorithms

ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation

Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Studies in the use and generation of heuristics (greedy algorithms)

Studies in the use and generation of heuristics (greedy algorithms)
Reasoning on interval and point-based disjunctive metric constraints in temporal contexts

Journal of Artificial Intelligence Research
The design and experimental analysis of algorithms for temporal reasoning

Journal of Artificial Intelligence Research

Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-based methods which interleave (sequentially) searching efforts with the application of consistency enforcing mechanisms and variable/value ordering heuristics. Alternatively, in this paper, we propose a new method that integrates effectively the CSP process into a limited closure process. Such integration allows us to define better informed heuristics. They are used to limit the complete closure process applied, with a number of disjunctive constraints, and so reduce their complexity, while reducing the search space. Moreover, we can maintain more time open disjunctive solutions in the CSP process, limiting the number of backtrackings realized. We show preliminary results obtained from several instances of scheduling problems.