Off-line temporary tasks assignment

Theoretical Computer Science

Volumn 287, Issue 2, 2002, Pages 419-428

  Azar, Yossi ^a   Regev, Oded ^a   Sgall, Jiří ^b   Woeginger, Gerhard J ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

PARALLEL MACHINES;

COMPUTATION THEORY;

EID: 0037190354     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00254-7     Document Type: Conference Paper

References (11)

1. On-line load balancing
2. On-line load balancing of temporary tasks on identical machines
3. Bounds for certain multiprocessor anomalies
4. Bounds on multiprocessing timing anomalies
5. Using dual approximation algorithms for scheduling problems: Theoretical and practical results
6. Exact and approximate algorithms for scheduling non-identical processors
7. Reducibility among combinatorial problems
8. Approximation algorithms for scheduling unrelated parallel machines
9. Algorithms for scheduling independent tasks