Efficient Approximation Algorithms for Scheduling Coflows with Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time.
Chi-Yeh ChenPublished in: CoRR (2023)
Keyphrases
- precedence constraints
- approximation algorithms
- minimize total
- release dates
- parallel processors
- scheduling problem
- vertex cover
- parallel machines
- identical machines
- precedence relations
- np hard
- special case
- single machine
- flowshop
- single machine scheduling problem
- sequence dependent setup times
- worst case
- maximum lateness
- processing times
- minimum cost
- setup times
- branch and bound algorithm
- approximation ratio
- constant factor
- undirected graph
- partial order
- shared memory
- optimal solution
- unit length