About: Semi-online preemptive scheduling: One algorithm for all variants; KAM-DIMATIA Series 2008-895 and ITI Series 2008-416     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
  • We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation rations for a small number of machines.
  • We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation rations for a small number of machines. (en)
  • Navrhujeme optimální algoritmy pro širokou třídu problémů z oblasti rozvrhování. (cs)
Title
  • Semi-online preemptive scheduling: One algorithm for all variants; KAM-DIMATIA Series 2008-895 and ITI Series 2008-416
  • Semi-online preemptive scheduling: One algorithm for all variants; KAM-DIMATIA Series 2008-895 and ITI Series 2008-416 (en)
  • Semi-online preemptivní rozvrhování: Jeden algoritmus pro všechny varianty (cs)
skos:prefLabel
  • Semi-online preemptive scheduling: One algorithm for all variants; KAM-DIMATIA Series 2008-895 and ITI Series 2008-416
  • Semi-online preemptive scheduling: One algorithm for all variants; KAM-DIMATIA Series 2008-895 and ITI Series 2008-416 (en)
  • Semi-online preemptivní rozvrhování: Jeden algoritmus pro všechny varianty (cs)
skos:notation
  • RIV/67985840:_____/08:00318801!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
  • 394359
http://linked.open...ai/riv/idVysledku
  • RIV/67985840:_____/08:00318801
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • algorithms; scheduling (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [56E40B5BBEB4]
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