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

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

Namespace Prefixes

PrefixIRI
n11http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://purl.org/net/nknouf/ns/bibtex#
n15http://localhost/temp/predkladatel/
n5http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/ontology/domain/vavai/
n18http://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/
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F06%3A00002925%21RIV07-MSM-11320___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F06%3A00002925%21RIV07-MSM-11320___
rdf:type
n13:Vysledek skos:Concept
dcterms:description
Článek navrhuje rozšíření temporálních sítí o paralelní a alternativní větvení, které umožňuje modelovat alternativní cesty v síti. Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. To simplify solving this problem, we propose a pre-processing step whose goal is to identify classes of equivalent nodes. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks. Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. To simplify solving this problem, we propose a pre-processing step whose goal is to identify classes of equivalent nodes. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks.
dcterms:title
Modelling Alternatives in Temporal Networks Modelování alternativ v temporálních sítích Modelling Alternatives in Temporal Networks
skos:prefLabel
Modelling Alternatives in Temporal Networks Modelling Alternatives in Temporal Networks Modelování alternativ v temporálních sítích
skos:notation
RIV/00216208:11320/06:00002925!RIV07-MSM-11320___
n3:strany
121;128
n3:aktivita
n17:Z n17:P
n3:aktivity
P(1M0545), P(GA201/04/1102), P(GD201/05/H014), Z(MSM0021620838)
n3:dodaniDat
n9:2007
n3:domaciTvurceVysledku
n4:8318573 n4:6481655 n4:9459413
n3:druhVysledku
n6:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
486196
n3:idVysledku
RIV/00216208:11320/06:00002925
n3:jazykVysledku
n10:eng
n3:klicovaSlova
Modelling; Alternatives; Temporal; Networks
n3:klicoveSlovo
n7:Networks n7:Modelling n7:Temporal n7:Alternatives
n3:kontrolniKodProRIV
[CFF55276C2EC]
n3:mistoKonaniAkce
Nottingham
n3:mistoVydani
Nottingham
n3:nazevZdroje
Proceedings of the 25th Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG)
n3:obor
n16:JC
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n5:GA201%2F04%2F1102 n5:1M0545 n5:GD201%2F05%2FH014
n3:rokUplatneniVysledku
n9:2006
n3:tvurceVysledku
Čepek, Ondřej Barták, Roman Surynek, Pavel
n3:typAkce
n11:EUR
n3:zahajeniAkce
2006-01-01+01:00
n3:zamer
n18:MSM0021620838
s:issn
1368-5708
s:numberOfPages
8
n20:hasPublisher
The University of Nottingham
n15:organizacniJednotka
11320