Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks.
Chi-Yeh ChenPublished in: IEEE Trans. Cloud Comput. (2024)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- identical machines
- precedence constraints
- parallel machines
- polynomial time approximation
- vertex cover
- release dates
- special case
- maximum lateness
- minimum cost
- set cover
- worst case
- primal dual
- scheduling algorithm
- parallel processors
- approximation ratio
- single machine
- facility location problem
- single machine scheduling problem
- setup times
- constant factor
- lower bound
- greedy algorithm
- single server
- combinatorial auctions
- parallel computing
- undirected graph