Pregled bibliografske jedinice broj: 39816
Scheduling Tasks with Non-negligible Intertask Communication onto Multiprocessors by using Genetic Algorithm
Scheduling Tasks with Non-negligible Intertask Communication onto Multiprocessors by using Genetic Algorithm // Artificial Neural Nets and Genetic Algorithms / Dobnikar, Andrej ; Steel, Nigel C. ; Pearson, David W. (ur.).
Beč: Springer, 1999. str. 196-201 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 39816 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Scheduling Tasks with Non-negligible Intertask Communication onto Multiprocessors by using Genetic Algorithm
Autori
Ježić, Gordan ; Kostelac, Robert ; Lovrek, Ignac ; Sinković, Vjekoslav
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Artificial Neural Nets and Genetic Algorithms
/ Dobnikar, Andrej ; Steel, Nigel C. ; Pearson, David W. - Beč : Springer, 1999, 196-201
Skup
ICANNGA 99
Mjesto i datum
Portorož, Slovenija, 06.04.1999. - 09.04.1999
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Genetic Algorithms; Intertask Communication; Cloning Operator
Sažetak
The paper deals with genetic algorithms for scheduling tasks with non-negligible intertask communication. Three genetic algorithms for scheduling with the primary goal to minimise finishing time are reported. The basic genetic algorithm includes reproduction, crossover and mutation operators, the improved version has additional cloning operator that allows duplicated scheduling and the third algorithm is the adaptive one. Experiments describing influence of genetic operators' probabilities, population size and number of generations on resulting schedules, comparison of algorithms and results obtained for different task granulation are discussed.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika
