Approximation schemes for minimizing average weighted completion time with release dates

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 32-43

  Afrati, Foto ^a   Bampis, Evripidis ^a   Chekuri, Chandra ^a   Karger, David ^a   Kenyon, Claire ^a   Khanna, Sanjeev ^a   Milis, Ioannis ^a   Queyranne, Maurice ^a   Skutella, Martin ^a   Stein, Cliff ^a   Sviridenko, Maxim ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

AVERAGE WEIGHTED COMPLETION TIME; PARALLEL MACHINES;

APPROXIMATION THEORY;

EID: 0032606578     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)