Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks.
Chi-Yeh ChenPublished in: CoRR (2023)
Keyphrases
- scheduling algorithm
- scheduling problem
- processing times
- single machine
- setup times
- completion times
- release dates
- parallel machines
- flowshop
- identical machines
- response time
- grid environment
- maximum lateness
- scheduling jobs
- scheduling strategy
- batch processing machines
- resource requirements
- single machine scheduling problem
- social networks
- optimal solution
- resource consumption
- lower bound
- scheduling policies
- computational grids
- tabu search
- special case
- parallel computing
- production scheduling
- weighted sum
- real time database systems
- approximation algorithms
- complex networks
- resource allocation
- wireless sensor networks
- np hard