62 search results - page 6 / 13 » A steady-state evolutionary algorithm for the job shop probl... |
AOR
2007
13 years 7 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
CAV
2001
Springer
14 years 13 hour ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Artificial immune system can be used to generate schedules in changing environments and it has been proven to be more robust than schedules developed using a genetic algorithm. Go...
JAIR
2007
13 years 7 months ago
2007
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...