Approximation Algorithms for Scheduling Parallel Jobs.
Klaus JansenRalf ThölePublished in: SIAM J. Comput. (2010)
Keyphrases
- approximation algorithms
- identical machines
- precedence constraints
- polynomial time approximation
- np hard
- batch processing machines
- scheduling problem
- parallel machines
- maximum lateness
- job scheduling
- open shop
- processing times
- parallel processors
- special case
- vertex cover
- single machine
- release dates
- strongly np hard
- identical parallel machines
- worst case
- setup times
- single machine scheduling problem
- constant factor
- set cover
- facility location problem
- minimum cost
- sequence dependent setup times
- primal dual
- undirected graph
- integer programming
- flowshop
- branch and bound algorithm
- randomized algorithms
- computational complexity
- approximation schemes
- combinatorial optimization
- scheduling strategy
- linear programming
- parallel computing
- approximation ratio