30 search results - page 3 / 6 » A Comparison of Genetic Algorithms for the Dynamic Job Shop ... |
AUSAI
2005
Springer
13 years 11 months ago
2005
Springer
This paper deals with the load-balancing of machines in a real-world job-shop scheduling problem, with identical machines. The load-balancing algorithm allocates jobs, split into l...
CORR
2008
Springer
13 years 6 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...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
ESWA
2008
13 years 6 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
MP
2002
13 years 5 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...