About: A lower bound on deterministic online algorithms for scheduling on related machines without preemption

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A lower bound on deterministic online algorithms for scheduling on related machines without preemption Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
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 (en)
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 (en)
skos:notation	RIV/67985840:_____/15:00440693!RIV15-GA0-67985840
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GBP202/12/G061), P(IAA100190902)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Ebenlendr, Tomáš
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	5
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/15:00440693
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	online algorithms; scheduling; makespan (en)
http://linked.open.../riv/klicoveSlovo	scheduling makespan online algorithms
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[61E1EF29E72D]
http://linked.open...i/riv/nazevZdroje	Theory of Computing Systems
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of excellence - Institute for theoretical computer science (CE-ITI) Mathematical logic, complexity, and algorithms
http://linked.open...UplatneniVysledku	2015
http://linked.open...v/svazekPeriodika	56
http://linked.open...iv/tvurceVysledku	Ebenlendr, Tomáš Sgall, J.
http://linked.open...ain/vavai/riv/wos	000348448100005
issn	1432-4350
number of pages	9 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/s00224-013-9451-6

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software