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

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

Namespace Prefixes

PrefixIRI
n6http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://purl.org/net/nknouf/ns/bibtex#
n10http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
n5http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F60461373%3A22340%2F01%3A00003886%21RIV%2F2004%2FMSM%2F223404%2FN/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F60461373%3A22340%2F01%3A00003886%21RIV%2F2004%2FMSM%2F223404%2FN
rdf:type
n7:Vysledek skos:Concept
dcterms:description
The problem of optimization of batch process production plan is most often solved for flowshop topology, i.e. for simple series of apparatuses. This paper deals with the possibilities of application of tabu search heuristics to an expanded variant of such a topology, specifically to flowshops with added limited number of doubled apparatuses. In addition to the problem of optimization of such a topology, the problem of simultaneous optimization of both production plan and plant topology is described here. The problem of optimization of batch process production plan is most often solved for flowshop topology, i.e. for simple series of apparatuses. This paper deals with the possibilities of application of tabu search heuristics to an expanded variant of such a topology, specifically to flowshops with added limited number of doubled apparatuses. In addition to the problem of optimization of such a topology, the problem of simultaneous optimization of both production plan and plant topology is described here.
dcterms:title
Optimization of Batch Flowshop with Parallel Processors Optimization of Batch Flowshop with Parallel Processors
skos:prefLabel
Optimization of Batch Flowshop with Parallel Processors Optimization of Batch Flowshop with Parallel Processors
skos:notation
RIV/60461373:22340/01:00003886!RIV/2004/MSM/223404/N
n3:strany
415;420
n3:aktivita
n15:Z
n3:aktivity
Z(MSM 223400007)
n3:dodaniDat
n4:2004
n3:domaciTvurceVysledku
n14:6552552
n3:druhVysledku
n21:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
690320
n3:idVysledku
RIV/60461373:22340/01:00003886
n3:jazykVysledku
n20:eng
n3:klicovaSlova
scheduling; batch processes; tabu search
n3:klicoveSlovo
n11:scheduling n11:batch%20processes n11:tabu%20search
n3:kontrolniKodProRIV
[C98A2A538C06]
n3:mistoKonaniAkce
Hradec nad Moravicí
n3:mistoVydani
Neuveden
n3:nazevZdroje
Proc. of the 35th Int. Conf. MOSIS '01
n3:obor
n19:CI
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:rokUplatneniVysledku
n4:2001
n3:tvurceVysledku
Poživil, Jaroslav Žďánský, Martin
n3:typAkce
n6:EUR
n3:zahajeniAkce
2001-05-09+02:00
n3:zamer
n5:MSM%20223400007
s:numberOfPages
6
n12:hasPublisher
MARQ., Jan Štefan
n18:isbn
80-85988-57-7
n10:organizacniJednotka
22340