Approximating total flow time on parallel machines

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 110-119

  Leonardi, Stefano ^a   Raz, Danny ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; RESOURCE ALLOCATION; THEOREM PROVING;

SHORTEST REMAINING PROCESSING TIME (SRPT); TOTAL FLOW TIME;

PARALLEL PROCESSING SYSTEMS;

EID: 0030642525     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258562     Document Type: Conference Paper

References (9)