Tight Approximation for Scheduling Parallel Jobs on Identical Clusters.
Marin BougeretPierre-François DutotKlaus JansenChristina RobenekDenis TrystramPublished in: IPDPS Workshops (2012)
Keyphrases
- identical machines
- polynomial time approximation
- batch processing machines
- parallel machines
- processing times
- single machine
- job scheduling
- scheduling problem
- maximum lateness
- unrelated parallel machines
- precedence constraints
- release dates
- minimize total
- approximation algorithms
- np hard
- scheduling strategy
- error bounds
- lower bound
- wafer fabrication
- sequence dependent setup times
- batch processing
- fuzzy clustering
- setup times
- weighted tardiness
- distributed memory
- clustering algorithm
- flowshop
- single machine scheduling problem
- hierarchical clustering
- optimal scheduling
- shared memory
- identical parallel machines
- upper bound
- release times
- cluster analysis
- precedence relations
- data points
- scheduling jobs
- worst case
- computational grids
- multiprocessor systems
- parallel computing
- special case
- closed form
- list scheduling
- searching in metric spaces
- scheduling algorithm
- queueing networks
- fixed number