A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
Over the past few years, a continually increasing number of research efforts have investigated the application of evolutionary computation techniques for the solution of scheduling problems. Scheduling problems can pose extremely complex combinatorial optimization problems, which belong to the NP-h...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2000
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23428 |
| Aporte de: |
| Sumario: | Over the past few years, a continually increasing number of research efforts have investigated the application of evolutionary computation techniques for the solution of scheduling problems.
Scheduling problems can pose extremely complex combinatorial optimization problems, which belong to the NP-hard family.
This work shows how an evolutionary approach using different chromosome representations with multiplicity feature MCMP can efficiently solve the JSSP. |
|---|