908 search results - page 85 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
156
Voted
NMA
2010
15 years 1 months ago
2010
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
119
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
128
Voted
ECRTS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
161
Voted
GECCO
2011
Springer
14 years 7 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
155
Voted
JAIR
2002
15 years 3 months ago
2002
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...