Improved approximation algorithms for scheduling parallel jobs on identical clusters.
Marin BougeretPierre-François DutotDenis TrystramKlaus JansenChristina RobenekPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- approximation algorithms
- identical machines
- precedence constraints
- polynomial time approximation
- batch processing machines
- open shop
- np hard
- parallel machines
- maximum lateness
- job scheduling
- scheduling problem
- vertex cover
- special case
- strongly np hard
- parallel processors
- identical parallel machines
- worst case
- processing times
- release dates
- minimum cost
- job shop
- single machine
- set cover
- sequence dependent setup times
- primal dual
- randomized algorithms
- single machine scheduling problem
- facility location problem
- setup times
- approximation schemes
- scheduling strategy
- flowshop
- computational grids
- constant factor
- constant factor approximation
- optimal solution
- combinatorial auctions
- batch processing
- scheduling policies
- production scheduling
- job shop scheduling
- undirected graph