Comparison of solution representations for scheduling in the unrelated machines environment (CROSBI ID 638447)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Đurasević, Marko ; Jakobović, Domagoj
engleski
Comparison of solution representations for scheduling in the unrelated machines environment
Most scheduling problems belong to the class of NP hard problems. Because of that reason, search based approaches are often used in order to find solutions for scheduling problems. In this paper we compare several search-based approaches for finding solutions for the unrelated machines scheduling problem. These search based approaches use two different solution representations for the aforementioned problem and the representations are compared with each other. The first representation uses a permutation vector to encode the solution, while the second one uses a vector of floating point numbers. The results of the search based approaches are compared to several existing heuristics developed especially for solving the unrelated machines scheduling problem. We also perform a complexity analysis of the search- based approaches, in which we compute the time needed for them to outperform the problem specific heuristics.
Genetic algorithms; Dynamic scheduling
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
2016.
objavljeno
Podaci o matičnoj publikaciji
MIPRO 2016 Int. Conf. Proceedings
Opatija: Institute of Electrical and Electronics Engineers (IEEE)
978-953-233-086-1
Podaci o skupu
MIPRO 2016
predavanje
30.05.2016-03.06.2016
Opatija, Hrvatska