Improved approximation schemes for scheduling unrelated parallel machines

Mathematics of Operations Research

Volumn 26, Issue 2, 2001, Pages 324-338

  Jansen, K ^a   Porkolab, L ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Fully polynomial approximation scheme; Makespan; Parallel machines; Scheduling

Indexed keywords

JOB ANALYSIS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

PARALLEL MACHINES;

SCHEDULING;

EID: 0035351602     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.26.2.324.10559     Document Type: Article

References (15)

1. Scheduling independent multiprocessor tasks
2. Coordination complexity of parallel price-directive decomposition
3. Exact and approximate algorithms for scheduling nonidentical processors
4. Linear-time approximation schemes for scheduling malleable parallel tasks
5. General multiprocessor task scheduling: Approximate solution in linear time
6. A linear time approximation scheme for the job shop scheduling problem
7. Linear time approximation schemes for parallel processor scheduling
8. On preemptive scheduling of unrelated parallel processors by linear programming
9. Approximation algorithms for scheduling unrelated parallel machines
10. ε-approximations with minimum packing constraint violation
11. Fast approximation algorithms for fractional packing and covering problems
12. An approximation algorithm for the generalized assignment problem
13. Scheduling multiple variable-speed machines
14. Approximate structured optimization by cyclic block-coordinate descent