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...

Descripción completa

Guardado en:
Detalles Bibliográficos
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