A (2 + ε)-Approximation for Scheduling Parallel Jobs in Platforms.
Pierre-François DutotKlaus JansenChristina RobenekDenis TrystramPublished in: Euro-Par (2013)
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
- identical parallel machines
- approximation algorithms
- scheduling strategy
- release dates
- scheduling jobs
- minimize total
- release times
- scheduling algorithm
- setup times
- weighted tardiness
- optimal scheduling
- wafer fabrication
- computational grids
- np hard
- batch processing
- error bounds
- multiprocessor systems
- resource manager
- precedence relations
- sequence dependent setup times
- parallel processors
- single machine scheduling problem
- shared memory
- flowshop
- deteriorating jobs
- scheduling policies
- information systems
- round robin
- distributed memory
- single server
- parallel computing
- parallel implementation
- upper bound
- special case