About: A lower bound for scheduling of unit jobs with immediate decision on parallel machines KAM-DIMATIA Series 2008-896 and ITI Series 2008-417     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)

AttributesValues
rdf:type
Description
  • Consider scheduling of unit jobs with release times and deadlines on $m$ identical machines with the objective to maximize the number of jobs completed before their deadlines. We prove a new lower bound for online algorithms with immediate decision. This means that the jobs arrive over time and the algorithm has to decide the schedule of each job immediately upon its release. Our lower bound tends to $e/(e-1)approx 1.58$ for many machines, matching the performance of the best algorithm.
  • Consider scheduling of unit jobs with release times and deadlines on $m$ identical machines with the objective to maximize the number of jobs completed before their deadlines. We prove a new lower bound for online algorithms with immediate decision. This means that the jobs arrive over time and the algorithm has to decide the schedule of each job immediately upon its release. Our lower bound tends to $e/(e-1)approx 1.58$ for many machines, matching the performance of the best algorithm. (en)
  • Dokazujeme asymptoticky optimální odhad pro rozvrhování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích. (cs)
Title
  • A lower bound for scheduling of unit jobs with immediate decision on parallel machines KAM-DIMATIA Series 2008-896 and ITI Series 2008-417
  • Dolní odhad pro rozvrhování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích (cs)
  • A lower bound for scheduling of unit jobs with immediate decision on parallel machines KAM-DIMATIA Series 2008-896 and ITI Series 2008-417 (en)
skos:prefLabel
  • A lower bound for scheduling of unit jobs with immediate decision on parallel machines KAM-DIMATIA Series 2008-896 and ITI Series 2008-417
  • Dolní odhad pro rozvrhování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích (cs)
  • A lower bound for scheduling of unit jobs with immediate decision on parallel machines KAM-DIMATIA Series 2008-896 and ITI Series 2008-417 (en)
skos:notation
  • RIV/67985840:_____/08:00318602!RIV09-AV0-67985840
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/05/0124), P(IAA1019401), Z(AV0Z10190503)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 354231
http://linked.open...ai/riv/idVysledku
  • RIV/67985840:_____/08:00318602
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • online algorithms; scheduling (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [DEE7CBA7EBB6]
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Sgall, Jiří
  • Ebenlendr, Tomáš
http://linked.open...n/vavai/riv/zamer
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software