Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2.
Klaus JansenRalf ThölePublished in: ICALP (1) (2008)
Keyphrases
- approximation algorithms
- approximation ratio
- identical machines
- precedence constraints
- polynomial time approximation
- batch processing machines
- np hard
- parallel machines
- maximum lateness
- scheduling problem
- vertex cover
- special case
- identical parallel machines
- strongly np hard
- parallel processors
- processing times
- release dates
- worst case
- minimum cost
- open shop
- single machine
- single machine scheduling problem
- setup times
- sequence dependent setup times
- randomized algorithms
- approximation schemes
- set cover
- primal dual
- approximation guarantees
- undirected graph
- reinforcement learning
- error bounds
- greedy algorithm
- shared memory
- parallel computing
- global constraints