A Fast Algorithm for Scheduling Equal-Length Jobs on Identical Machines

A Fast Algorithm for Scheduling Equal-Length Jobs on Identical Machines

dc.contributoren-US
dc.contributores-ES
dc.creatorVAKHANIA, NODARI
dc.date2009-10-05
dc.date.accessioned2018-03-16T14:22:12Z
dc.date.available2018-03-16T14:22:12Z
dc.identifierhttp://ojs.unam.mx/index.php/cys/article/view/2461
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1190333
dc.descriptionTHE 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.en-US
dc.descriptionTHE 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.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherComputación y Sistemases-ES
dc.relationhttp://ojs.unam.mx/index.php/cys/article/view/2461/2023
dc.sourceComputación y Sistemas; Vol 1, No 004 (1998)es-ES
dc.source1405-5546
dc.subjectSCHEDULING; IDENTICAL PROCESSORS; READINESS TIME; TAIL; COMPUTATIONAL COMPLEXITYen-US
dc.subjectes-ES
dc.titleA Fast Algorithm for Scheduling Equal-Length Jobs on Identical Machinesen-US
dc.titleA Fast Algorithm for Scheduling Equal-Length Jobs on Identical Machineses-ES
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución