265 search results - page 15 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
AIPS
2008
13 years 10 months ago
2008
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
DAM
2008
13 years 8 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...