175 search results - page 4 / 35 » Approximation Algorithms for Flexible Job Shop Problems |
GECCO
2000
Springer
15 years 6 months ago
2000
Springer
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...
149
Voted
AIPS
2008
15 years 5 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...
129
Voted
GECCO
1999
Springer
15 years 7 months ago
1999
Springer
This paper deals with the study of population diversity in Genetic Algorithms for Job Shop Scheduling Problems. A definition of population diversity at the phenotype level and a ...
151
Voted
CLOUDCOM
2010
Springer
15 years 24 days ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
116
Voted
IJIIP
2010
15 years 2 days ago
2010