Approximation Algorithms for Scheduling Parallel Jobs with More Machines.
Jae-Hoon KimPublished in: J. Inform. and Commun. Convergence Engineering (2011)
Keyphrases
- identical machines
- approximation algorithms
- polynomial time approximation
- precedence constraints
- np hard
- job scheduling
- scheduling problem
- processing times
- vertex cover
- special case
- single machine
- minimum cost
- single machine scheduling problem
- worst case
- release dates
- primal dual
- parallel processors
- facility location problem
- approximation schemes
- maximum lateness
- open shop
- sequence dependent setup times
- set cover
- constant factor
- setup times
- parallel machines
- randomized algorithms
- approximation ratio
- combinatorial auctions
- constant factor approximation
- integer programming
- linear program
- tabu search
- disjoint paths