Approximation algorithms for scheduling on multi-core processor with shared speedup resources.
Xufeng ChenDeshi YePublished in: Discret. Optim. (2016)
Keyphrases
- approximation algorithms
- multi core processors
- precedence constraints
- resource allocation
- computing resources
- np hard
- resource constraints
- special case
- scheduling problem
- vertex cover
- worst case
- resource consumption
- open shop
- limited resources
- parallel programming
- resource management
- gene expression programming
- approximation ratio
- cloud computing
- constant factor
- job shop
- parallel machines
- parallel computing
- randomized algorithms
- real time