This HTML5 document contains 41 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/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://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/
n10http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F15%3A00440693%21RIV15-GA0-67985840/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F15%3A00440693%21RIV15-GA0-67985840
rdf:type
n9:Vysledek skos:Concept
dcterms:description
We consider one-by-one online scheduling on uniformly related machines. The input is a sequence of machines with different speeds and a sequence of jobs with different processing times. The output is a schedule which assigns the jobs to the machines; the completion time of a machine is the sum of the processing times of jobs assigned to it divided by its speed. The objective is to minimize the maximal completion time. The jobs arrive one by one and each has to be assigned to one machine immediately and irrevocably without the knowledge of the future jobs. We prove a new lower bound of 2.564 on the competitive ratio of deterministic online algorithms for this problem, improving the previous lower bound of 2.438. We consider one-by-one online scheduling on uniformly related machines. The input is a sequence of machines with different speeds and a sequence of jobs with different processing times. The output is a schedule which assigns the jobs to the machines; the completion time of a machine is the sum of the processing times of jobs assigned to it divided by its speed. The objective is to minimize the maximal completion time. The jobs arrive one by one and each has to be assigned to one machine immediately and irrevocably without the knowledge of the future jobs. We prove a new lower bound of 2.564 on the competitive ratio of deterministic online algorithms for this problem, improving the previous lower bound of 2.438.
dcterms:title
A lower bound on deterministic online algorithms for scheduling on related machines without preemption A lower bound on deterministic online algorithms for scheduling on related machines without preemption
skos:prefLabel
A lower bound on deterministic online algorithms for scheduling on related machines without preemption A lower bound on deterministic online algorithms for scheduling on related machines without preemption
skos:notation
RIV/67985840:_____/15:00440693!RIV15-GA0-67985840
n3:aktivita
n15:I n15:P
n3:aktivity
I, P(GBP202/12/G061), P(IAA100190902)
n3:cisloPeriodika
1
n3:dodaniDat
n5:2015
n3:domaciTvurceVysledku
n17:7083556
n3:druhVysledku
n16:J
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
5
n3:idVysledku
RIV/67985840:_____/15:00440693
n3:jazykVysledku
n4:eng
n3:klicovaSlova
online algorithms; scheduling; makespan
n3:klicoveSlovo
n11:makespan n11:scheduling n11:online%20algorithms
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[61E1EF29E72D]
n3:nazevZdroje
Theory of Computing Systems
n3:obor
n14:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n12:GBP202%2F12%2FG061 n12:IAA100190902
n3:rokUplatneniVysledku
n5:2015
n3:svazekPeriodika
56
n3:tvurceVysledku
Ebenlendr, Tomáš Sgall, J.
n3:wos
000348448100005
s:issn
1432-4350
s:numberOfPages
9
n10:doi
10.1007/s00224-013-9451-6