Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness

Journal of Heuristics

Volumn 8, Issue 4, 2002, Pages 415-428

  Kovalyov, Mikhail Y ^a   Werner, Frank ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Approximation; Parallel machine scheduling; Total tardiness

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SCHEDULING;

NONPREEMPTIVE JOBS;

PARALLEL PROCESSING SYSTEMS;

EID: 0036644332     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015487829051     Document Type: Article

References (13)

1. Approximation algorithms for combinatorial problems: An annotated bibliography
2. Optimization and approximation in deterministic sequencing and scheduling: A survey
3. Exact and approximate algorithms for scheduling nonidentical processors
4. Fast approximation algorithms for the knapsack and sum of subset problems
5. On the existence of fast approximation schemes
6. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
7. The construction of ε-approximate algorithms in successively constructed sets
8. Scheduling with deadlines and loss functions on k parallel machines
9. Algorithms for scheduling independent tasks
10. General techniques for combinatorial approximation