Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
Parallel machine scheduling, also known as parallel task scheduling, involves the assignment of multiple tasks onto the system architecture’s processing components (a bank of machines in parallel). A basic model involving m machines and n independent jobs is the foundation of more complex models. H...
Guardado en:
| Autores principales: | Gatica, Claudia Ruth, Ferretti, Edgardo, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2003
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21428 |
| Aporte de: |
Ejemplares similares
-
Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems
por: Ferretti, Edgardo, et al.
Publicado: (2004) -
Studying the parallel task scheduling problem with conventional and evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2001) -
A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
por: Gatica, Claudia Ruth, et al.
Publicado: (2013) -
Solving the single machine scheduling problem with sequence-dependent set-up times as a TSP via evolutionary algorithms
por: Minetti, Gabriela F., et al.
Publicado: (2001) -
A multirecombinative evolutionary approach to solve the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)