Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2591
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCorrêa, Ricardo C.-
dc.date.accessioned2017-08-04T12:55:33Z-
dc.date.available2017-08-06T03:00:16Z-
dc.date.issued1997-12-31-
dc.identifier.citationCORRÊA, R. C. On the efficiency of a genetic algorithm for the multiprocessor scheduling problem. Rio de Janeiro: NCE, UFRJ, 1997. 14 p. (Relatório Técnico, 07/97)pt_BR
dc.identifier.urihttp://hdl.handle.net/11422/2591-
dc.description.abstractIn the multiprocessor scheduling problem a given program is to be scheduled in a given multiprocessor system such that the program's execution time is minimized. This problem being very hard to solve exactly, many heuristic methods for finding a suboptimal schedule exist. An efficient genetic algorithm which introduces some knowledge about the scheduling problem represented by the use of a list heuristic in the crossover and mutation genetic operations was recently proposed [3] in this paper we investigate the efficiency of this genetic algorithm from a theoretical point of view. In particular , we demonstrate the ability of the knowledge-augmented crossover operator to generate all the space of feasible solutions.en
dc.languageengpt_BR
dc.relation.ispartofRelatório Técnico NCEpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectAlgoritmos genéticospt_BR
dc.subjectMultiprocessadorespt_BR
dc.subjectEscalonamento multidimensionalpt_BR
dc.titleOn the efficiency of a genetic algorithm for the multiprocessor scheduling problemen
dc.typeRelatóriopt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionaispt_BR
dc.subject.cnpqCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO::ANALISE DE ALGORITMOS E COMPLEXIDADE DE COMPUTACAOpt_BR
dc.citation.issue0797pt_BR
dc.embargo.termsabertopt_BR
Appears in Collections:Relatórios

Files in This Item:
File Description SizeFormat 
07_97.pdf698.75 kBAdobe PDFView/Open


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