Sciweavers

908 search results - page 36 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
87
Voted
EVOW
2005
Springer
15 years 7 months ago
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
Konstantin Chakhlevitch, Peter I. Cowling
IJAIT
2008
99views more  IJAIT 2008»
15 years 1 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
15 years 6 months ago
Test scheduling for core-based systems
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
Krishnendu Chakrabarty
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
15 years 2 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
AUSAI
2003
Springer
15 years 7 months ago
Guided Operators for a Hyper-Heuristic Genetic Algorithm
We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find...
Limin Han, Graham Kendall