908 search results - page 45 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
121
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
106
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
120
click to vote
CP
1998
Springer
15 years 6 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
110
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...