Sciweavers

544 search results - page 23 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
LION
2009
Springer
203views Optimization» more  LION 2009»
14 years 2 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
AAAI
1996
13 years 9 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
AAAI
1994
13 years 9 months ago
Case-Based Acquisition of User Preferences for Solution Improvement in Ill-Structured Domains
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
Katia P. Sycara, Kazuo Miyashita
CEC
2009
IEEE
14 years 2 months ago
Dispatching rules for production scheduling: A hyper-heuristic landscape analysis
— Hyper-heuristics or “heuristics to chose heuristics” are an emergent search methodology that seeks to automate the process of selecting or combining simpler heuristics in o...
Gabriela Ochoa, José Antonio Vázquez...
ESANN
2003
13 years 9 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer