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

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

Namespace Prefixes

PrefixIRI
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://purl.org/net/nknouf/ns/bibtex#
n12http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F04%3A03099440%21RIV%2F2005%2FMSM%2F212305%2FN/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F04%3A03099440%21RIV%2F2005%2FMSM%2F212305%2FN
rdf:type
n7:Vysledek skos:Concept
dcterms:description
Není k dispozici This paper presents a scheduling problem for a monoprocessor without preemption with timing constraints given by a task-on-node graph. The precedence relations are given by an oriented graph where edges are related either to the minimum time or to the maximum time elapsed between start times of the tasks. The processing time of a given task is associated to a given node in the oriented graph. The problem, finding an optimal schedule satisfying the timing constraints while minimizing makespan Cmax, is solved by two approaches. The first is implemented as a B&B algorithm using a Critical Path estimation and estimation of Remaining Processing TimeThe second solution is based on ILP. Experimental results show comparison of the B&B and ILP solution. This paper presents a scheduling problem for a monoprocessor without preemption with timing constraints given by a task-on-node graph. The precedence relations are given by an oriented graph where edges are related either to the minimum time or to the maximum time elapsed between start times of the tasks. The processing time of a given task is associated to a given node in the oriented graph. The problem, finding an optimal schedule satisfying the timing constraints while minimizing makespan Cmax, is solved by two approaches. The first is implemented as a B&B algorithm using a Critical Path estimation and estimation of Remaining Processing TimeThe second solution is based on ILP. Experimental results show comparison of the B&B and ILP solution.
dcterms:title
Scheduling with Start Time Related Deadlines Scheduling with Start Time Related Deadlines Není k dispozici
skos:prefLabel
Není k dispozici Scheduling with Start Time Related Deadlines Scheduling with Start Time Related Deadlines
skos:notation
RIV/68407700:21230/04:03099440!RIV/2005/MSM/212305/N
n3:strany
94 ; 94
n3:aktivita
n20:P
n3:aktivity
P(LN00B096)
n3:dodaniDat
n6:2005
n3:domaciTvurceVysledku
n8:5834805 n8:7678436
n3:druhVysledku
n10:D
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
585534
n3:idVysledku
RIV/68407700:21230/04:03099440
n3:jazykVysledku
n4:eng
n3:klicovaSlova
branch and bound; integer linear programming; monoprocessor; sheduling
n3:klicoveSlovo
n5:integer%20linear%20programming n5:sheduling n5:branch%20and%20bound n5:monoprocessor
n3:kontrolniKodProRIV
[0B36CFD129C5]
n3:mistoKonaniAkce
Taipei
n3:mistoVydani
New York
n3:nazevZdroje
IEEE Conference on Control Applications, International Symposium on Inteligent Control, Computer Aided Control Systems Design 2004
n3:obor
n19:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n14:LN00B096
n3:rokUplatneniVysledku
n6:2004
n3:tvurceVysledku
Šůcha, Přemysl Hanzálek, Zdeněk
n3:typAkce
n9:WRD
n3:zahajeniAkce
2004-09-02+02:00
s:numberOfPages
1
n18:hasPublisher
IEEE Control System Society
n12:organizacniJednotka
21230