| dc.creator | Corrêa, Ricardo C. | |
| dc.date | 2017-08-04T12:55:33Z | |
| dc.date | 2023-09-27T03:01:47Z | |
| dc.date | 1997-12-31 | |
| dc.date.accessioned | 2023-09-27T13:10:03Z | |
| dc.date.available | 2023-09-27T13:10:03Z | |
| dc.identifier | CORRÊ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) | |
| dc.identifier | http://hdl.handle.net/11422/2591 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8902347 | |
| dc.description | In 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. | |
| dc.language | eng | |
| dc.publisher | Brasil | |
| dc.publisher | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais | |
| dc.relation | Relatório Técnico NCE | |
| dc.rights | Acesso Aberto | |
| dc.subject | Algoritmos genéticos | |
| dc.subject | Multiprocessadores | |
| dc.subject | Escalonamento multidimensional | |
| dc.subject | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO::ANALISE DE ALGORITMOS E COMPLEXIDADE DE COMPUTACAO | |
| dc.title | On the efficiency of a genetic algorithm for the multiprocessor scheduling problem | |
| dc.type | Relatório | |
