Solutions to the dynamic average tardiness problem in single machine environments
In dynamic scheduling arrival times as well, as some or all job attributes are unknown in advance. Dynamism can be classified as partial or total. In simplest partially dynamic problems the only unknown attribute of a job is its arrival time rj. A job arrival can be given at any instant in the time...
Guardado en:
| Autores principales: | San Pedro, María Eugenia de, Lasso, Marta Graciela, Villagra, Andrea, Pandolfi, Daniel, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Español |
| Publicado: |
2003
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/22728 |
| Aporte de: |
Ejemplares similares
-
Knowledge insertion: an efficient approach to reduce search effort in evolutionary scheduling
por: Pandolfi, Daniel, et al.
Publicado: (2003) -
Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems
por: Ferretti, Edgardo, et al.
Publicado: (2004) -
Influence of crossover operators in evolutionary scheduling under multirecombined schemes
por: San Pedro, María Eugenia de, et al.
Publicado: (2003) -
Algorithms to solve the dynamic weighted tardiness problem
por: Lasso, Marta Graciela, et al.
Publicado: (2002) -
Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001)