62 search results - page 9 / 13 » Intelligent Backtracking Techniques for Job Shop Scheduling |
AAAI
2000
13 years 8 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
CSCLP
2004
Springer
14 years 3 days ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
IEAAIE
2001
Springer
13 years 11 months ago
2001
Springer
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-b...
ICTAI
1996
IEEE
13 years 11 months ago
1996
IEEE
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
AIPS
2006
13 years 8 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...