Por favor utiliza este link para citar o compartir este documento: http://repositoriodigital.academica.mx/jspui/handle/987654321/8604
Título: A Fast Algorithm for Scheduling Equal-Length Jobs on Identical Machines
A Fast Algorithm for Scheduling Equal-Length Jobs on Identical Machines
Autores: 
Palabras clave: SCHEDULING; IDENTICAL PROCESSORS; READINESS TIME; TAIL; COMPUTATIONAL COMPLEXITY
Fecha de publicación: 10-Sep-2011
Editorial: Computación y Sistemas
Descripción: THE PROBLEM OF SEQUENCING JOBS OF EQUAL DURATIONS WITH AVAILABLE (READINESS) TIMES AND THE ADDITIONAL TAILS ON A SET OF PARALLEL IDENTICAL PROCESSORS IS CONSIDERED. THE OBJECTIVE IS TO MINIMIZE THE MAXIMAL COMPLETION TIME. WE PRESENT A NEW POLYGOMIAL ALGORITHM WHICH IMPROVES THE RUNNIG TIME OF THE PREVIOUSLY KNOWN BEST ALGORITHM UNDER THE REALISTIC ASSUMPTION THAT TAILS OF ALL JOBS ARE BOUNDED BY SOME SUFFICIENTLY LARGE CONSTANT.
THE PROBLEM OF SEQUENCING JOBS OF EQUAL DURATIONS WITH AVAILABLE (READINESS) TIMES AND THE ADDITIONAL TAILS ON A SET OF PARALLEL IDENTICAL PROCESSORS IS CONSIDERED. THE OBJECTIVE IS TO MINIMIZE THE MAXIMAL COMPLETION TIME. WE PRESENT A NEW POLYGOMIAL ALGORITHM WHICH IMPROVES THE RUNNIG TIME OF THE PREVIOUSLY KNOWN BEST ALGORITHM UNDER THE REALISTIC ASSUMPTION THAT TAILS OF ALL JOBS ARE BOUNDED BY SOME SUFFICIENTLY LARGE CONSTANT.
Other Identifiers: http://revistas.unam.mx/index.php/cys/article/view/2461
Aparece en las Colecciones:Computación y Sistemas

Archivos de este documento:
No hay archivos asociados a este documento.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.