Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
Li, Keqin
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 3 (1999), p. 155-166 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Access to full text
Publié le : 1999-01-01
EUDML-ID : urn:eudml:doc:120594 
@article{01375583,
     title = {Analysis of an approximation algorithm for scheduling indepentent parallel tasks.},
     journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
     volume = {3},
     year = {1999},
     pages = {155-166},
     zbl = {0947.68169},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01375583}
}

Li, Keqin. Analysis of an approximation algorithm for scheduling indepentent parallel tasks.. Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 3 (1999) pp. 155-166. http://gdmltest.u-ga.fr/item/01375583/