This HTML5 document contains 38 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F11%3A00181877%21RIV12-MSM-21230___/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F11%3A00181877%21RIV12-MSM-21230___
rdf:type
n7:Vysledek skos:Concept
dcterms:description
This paper presents a genetic algorithm, implemented on a GPU (Graphics Processing Unit), solving permutation flow shop scheduling problem. This approach is based on the homogeneous computing model in order to maximize the algorithm efficiency. The genetic algorithm is based on work presented by Pospichal et al. In our work, we suggest several improvements (e.g. another mechanism for individuals migration) allowing to apply this algorithm on a wider group of NP-hard combinatorial problems. Our experimental results show significant speedup with respect to the sequential algorithm version. This paper presents a genetic algorithm, implemented on a GPU (Graphics Processing Unit), solving permutation flow shop scheduling problem. This approach is based on the homogeneous computing model in order to maximize the algorithm efficiency. The genetic algorithm is based on work presented by Pospichal et al. In our work, we suggest several improvements (e.g. another mechanism for individuals migration) allowing to apply this algorithm on a wider group of NP-hard combinatorial problems. Our experimental results show significant speedup with respect to the sequential algorithm version.
dcterms:title
Flow Shop Scheduling on GPU Flow Shop Scheduling on GPU
skos:prefLabel
Flow Shop Scheduling on GPU Flow Shop Scheduling on GPU
skos:notation
RIV/68407700:21230/11:00181877!RIV12-MSM-21230___
n7:predkladatel
n17:orjk%3A21230
n3:aktivita
n18:P n18:Z
n3:aktivity
P(GPP103/10/P401), Z(MSM6840770038)
n3:dodaniDat
n16:2012
n3:domaciTvurceVysledku
n13:1934007 n13:7678436
n3:druhVysledku
n14:O
n3:duvernostUdaju
n6:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
199988
n3:idVysledku
RIV/68407700:21230/11:00181877
n3:jazykVysledku
n5:eng
n3:klicovaSlova
GPU; Flow shop; CUDA; Scheduling; Combinatorial optimization
n3:klicoveSlovo
n4:CUDA n4:Combinatorial%20optimization n4:Flow%20shop n4:GPU n4:Scheduling
n3:kontrolniKodProRIV
[6586E38512FE]
n3:obor
n12:JD
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n10:GPP103%2F10%2FP401
n3:rokUplatneniVysledku
n16:2011
n3:tvurceVysledku
Šůcha, Přemysl Zajíček, Tomáš
n3:zamer
n11:MSM6840770038
n19:organizacniJednotka
21230