Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Evolving dispatching rules for optimising many- objective criteria in the unrelated machines environment (CROSBI ID 242206)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Đurasević, Marko ; Jakobović, Domagoj Evolving dispatching rules for optimising many- objective criteria in the unrelated machines environment // Genetic programming and evolvable machines, 19 (2018), 1; 9-51

Podaci o odgovornosti

Đurasević, Marko ; Jakobović, Domagoj

engleski

Evolving dispatching rules for optimising many- objective criteria in the unrelated machines environment

Dispatching rules are often a method of choice for solving various scheduling problems. Most often, they are designed by human experts in order to optimise a certain criterion. However, it is seldom the case that a schedule should optimise a single criterion all alone. More common is the case where several criteria need to be optimised at the same time. This paper deals with the problem of automatic design of dispatching rules (DRs) by the use of genetic programming, for many-objective scheduling problems. Four multi-objective and many- objective algorithms, including nondominated sorting genetic algorithm II, nondominated sorting genetic algorithm III, harmonic distance based multi-objective evolutionary algorithm and multi-objective evolutionary algorithm based on decomposition, have been used in order to obtain sets of Pareto optimal solutions for various many-objective scheduling problems. Through experiments it was shown that automatically generated multi-objective DRs not only achieve good performance when compared to standard DRs, but can also outperform automatically generated single objective DRs for most criteria combinations.

Dispatching rules Genetic programming Many-objective optimisation Scheduling Unrelated machines environment

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

19 (1)

2018.

9-51

objavljeno

1389-2576

1573-7632

Povezanost rada

Računarstvo

Indeksiranost