About: Lower bounds for online makespan minimization on a small number of related machines

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

About: Lower bounds for online makespan minimization on a small number of related machines 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
rdfs:seeAlso	http://dx.doi.org/10.1007/s10951-012-0288-7
Description	In online makespan minimization, the jobs characterized by their processing time arrive one-by-one and each has to be assigned to one of the m uniformly related machines. The goal is to minimize the length of the schedule. We prove new combinatorial lower bounds for m=4 and m=5, and computer-assisted lower bounds for m{=11. In online makespan minimization, the jobs characterized by their processing time arrive one-by-one and each has to be assigned to one of the m uniformly related machines. The goal is to minimize the length of the schedule. We prove new combinatorial lower bounds for m=4 and m=5, and computer-assisted lower bounds for m{=11. (en)
Title	Lower bounds for online makespan minimization on a small number of related machines Lower bounds for online makespan minimization on a small number of related machines (en)
skos:prefLabel	Lower bounds for online makespan minimization on a small number of related machines Lower bounds for online makespan minimization on a small number of related machines (en)
skos:notation	RIV/00216208:11320/13:10159397!RIV14-GA0-11320___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GBP202/12/G061), P(GEGIG/11/E023), P(IAA100190902)
http://linked.open...iv/cisloPeriodika	5
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Sgall, Jiří Jeż, Łukasz Schwartz, Jarett
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	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	85499
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/13:10159397
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Related machines; Makespan; Scheduling; Online algorithms (en)
http://linked.open.../riv/klicoveSlovo	Online algorithms Makespan Scheduling Related machines
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[7A0849DBD7F4]
http://linked.open...i/riv/nazevZdroje	Journal of Scheduling
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of excellence - Institute for theoretical computer science (CE-ITI) Graph Drawings and Representations Mathematical logic, complexity, and algorithms
http://linked.open...UplatneniVysledku	2013
http://linked.open...v/svazekPeriodika	16
http://linked.open...iv/tvurceVysledku	Jeż, Łukasz Sgall, Jiří Schwartz, Jarett Békési, József
http://linked.open...ain/vavai/riv/wos	000324108500007
issn	1094-6136
number of pages	9 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/s10951-012-0288-7
http://localhost/t...ganizacniJednotka	11320

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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software