908 search results - page 27 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
154
Voted
HIS
2009
14 years 11 months ago
2009
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...
99
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
118
click to vote
AIPS
2011
14 years 5 months ago
2011
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
HEURISTICS
2007
15 years 1 months ago
2007
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
124
click to vote
OR
2005
Springer
15 years 7 months ago
2005
Springer
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...