Domination analysis for scheduling on non preemptive uniformly related machines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

Domination analysis for scheduling on non preemptive uniformly related machines

Fichier principal
Vignette du fichier
dmAQ0107.pdf (158.96 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01197235 , version 1 (11-09-2015)

Identifiers

Cite

Idan Eisner, Alek Vainshtein. Domination analysis for scheduling on non preemptive uniformly related machines. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.81-82, ⟨10.46298/dmtcs.2985⟩. ⟨hal-01197235⟩

Collections

INSMI TDS-MACS
58 View
522 Download

Altmetric

Share

Gmail Facebook X LinkedIn More