A job allocation algorithm for parallel processors

We are given a nite set of jobs of equal processing times with readiness times and tails and a set of identical processors. The aim is to schedule the given set of jobs on the given set of processors to minimize the total processing time (or makespan). An algorithm for that problem with the time co...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Vakhania, Nodari
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 1997
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23931
Aporte de:

Ejemplares similares