908 search results - page 21 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
122
click to vote
IJCAI
1993
15 years 3 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
112
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
124
Voted
IJCAI
1997
15 years 3 months ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
115
Voted
CAEPIA
2003
Springer
15 years 7 months ago
2003
Springer
We present a tool for solving and plotting train schedules which has been developed in collaboration with the National Network of Spanish Railways (RENFE). This tool transforms rai...