A Fast AIgorithm for Scheduling Equal-Lenght Jobs on Identical Machines

Por favor, use este identificador para citar o enlazar este ítem: http://repositoriodigital.ipn.mx/handle/123456789/15088

Registro completo de metadatos

Campo DC	Valor	Lengua/Idioma
dc.contributor.author	Vakhania, Nodari	-
dc.date.accessioned	2013-04-12T01:20:42Z	-
dc.date.available	2013-04-12T01:20:42Z	-
dc.date.issued	1998-06-10	-
dc.identifier.citation	Revista Computación y Sistemas; Vol. 1 No. 4	es
dc.identifier.issn	1405-5546	-
dc.identifier.uri	http://www.repositoriodigital.ipn.mx/handle/123456789/15088	-
dc.description.abstract	Abstract. The problem 01 sequencing jobs 01 equal durations with available (readiness) times and the additional taüs on a set 01 parallel identical processors is considered. The objective is to minimize the maximal completion time. We present a new polynomial algorithm whích improves the running time 01 the previously known best algorithm under the realistic assumption that tails ol all jobs are bounded by some sufficiently large constant.	es
dc.description.sponsorship	Instituto Politécnico Nacional - Centro de Investigación en Computación (CIC).	es
dc.language.iso	en_US	es
dc.publisher	Revista Computación y Sistemas; Vol. 1 No. 4	es
dc.relation.ispartofseries	Revista Computación y Sistemas;Vol. 1 No. 4	-
dc.subject	Keywards. Scheduling, Identical Processors, Readi4 ness Time, Tail, Computational Complexity.	es
dc.title	A Fast AIgorithm for Scheduling Equal-Lenght Jobs on Identical Machines	es
dc.type	Article	es
dc.description.especialidad	Investigación en Computación	es
dc.description.tipo	PDF	es
Aparece en las colecciones:	Revistas

Ficheros en este ítem:

Fichero	Descripción	Tamaño	Formato
ART 5.pdf		1.15 MB	Adobe PDF	Visualizar/Abrir

El Instituto Politécnico Nacional