Paper Info
Title
Comparison Of Solution Representations For Scheduling In The Unrelated Machines Environment
Abstract
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.
Year
Venue
Field
2016
2016 39TH INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO)
Mathematical optimization,Multiprocessor scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Open-shop scheduling,Theoretical computer science,Two-level scheduling,Nurse scheduling problem,Rate-monotonic scheduling,Dynamic priority scheduling
DocType
Citations 
PageRank 
Conference
2
0.36
References 
Authors
14
2
Name
Order
Citations
PageRank
Marko Durasevic191.48
Domagoj Jakobovic219529.01