Adaptability of multirecombinated evolutionary algorithms to changing common due dates
In the restricted single-machine common due date problem, the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties. This problem, even in its simplest formulation, is an NP-Hard optimization problem. New trends to enhance evolutionary algor...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21650 |
| Aporte de: |
| Sumario: | In the restricted single-machine common due date problem, the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties.
This problem, even in its simplest formulation, is an NP-Hard optimization problem.
New trends to enhance evolutionary algorithms introduced multiple-crossovers-on-multiple-parents (MCMP) a multirecombinative approach allowing multiple crossovers on the selected pool of (more than two) parents. MCMP-V is a novel MCMP variant, which directly applies multirecombination to the Lee and Kim approach using uniform scanning crossover. |
|---|