PTAS for minimizing the weighted sum of job completion times on parallel machines

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 400-407

  Skutella, Martin ^a   Woeginger, Gerhard J ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; SCHEDULING;

JOB COMPLETION; PARALLEL MACHINES;

COMPUTATIONAL COMPLEXITY;

EID: 0032650090     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (16)