Hrvatska znanstvena Sekcija img
3 gif
 About the project
4 gif
Basic search
Advanced search
Statistical data
Other bibliographies
Similar projects
 Catalogues and databases

Bibliographic record number: 830468


Authors: Đurasević, Marko; Jakobović, Domagoj
Title: Comparison of solution representations for scheduling in the unrelated machines environment
( Comparison of solution representations for scheduling in the unrelated machines environment )
Source: MIPRO 2016 Int. Conf. ProceedingsOpatija : IEEE , 2016. (ISBN: 978-953-233-086-1).
Meeting: MIPRO 2016
Location and date: Opatija, Hrvatska, 30.5-3.6.2016
Keywords: Genetic algorithms; Dynamic scheduling
( Genetic algorithms; Dynamic scheduling )
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.
Type of meeting: Predavanje
Type of presentation in a journal: Full-text (1500 words and more)
Type of peer-review: International peer-review
Original language: eng
Category: Znanstveni
Research fields:
Computer science
Contrib. to CROSBI by: Marko Đurasević (, 28. Kol. 2016. u 20:58 sati

Print version   za tiskati