Heuristics for partial and total dynamic W-T problems 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...

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: 2003
Materias:
Ciencias Informáticas
Environments
gestión
informática
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21433
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares