Algorithms to solve the dynamic weighted tardiness problem
In static scheduling problems it is assumed that jobs are ready at zero time or before processing begins. In dynamic scheduling problems a job arrival can be given at any instant in the time interval between zero and a limit established by its processing time, ensuring to accomplish it before the du...
Guardado en:
| Autores principales: | Lasso, Marta Graciela, Pandolfi, Daniel, San Pedro, María Eugenia de, Villagra, Andrea, Vilanova, Gabriela, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2002
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23133 |
| Aporte de: |
Ejemplares similares
-
Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001) -
Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002) -
Solutions to the dynamic average tardiness problem in single machine environments
por: San Pedro, María Eugenia de, et al.
Publicado: (2003) -
Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002) -
Influence of crossover operators in evolutionary scheduling under multirecombined schemes
por: San Pedro, María Eugenia de, et al.
Publicado: (2003)