Efficient Approximation Algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks.
Chi-Yeh ChenPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- scheduling problem
- parallel machines
- np hard
- precedence constraints
- identical machines
- special case
- vertex cover
- maximum lateness
- single machine
- minimum cost
- worst case
- strongly np hard
- polynomial time approximation
- randomized algorithms
- release dates
- open shop
- identical parallel machines
- job shop scheduling
- parallel processors
- facility location problem
- approximation ratio
- job shop
- single machine scheduling problem
- network design
- parallel computing
- branch and bound algorithm
- primal dual
- resource allocation
- objective function
- resource constraints
- column generation
- processing times
- disjoint paths
- integrality gap