Scheduling Coflows with Precedence Constraints for Minimizing the Total Weighted Completion Time in Identical Parallel Networks.
Chi-Yeh ChenPublished in: CoRR (2022)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- identical machines
- release dates
- maximum lateness
- parallel processors
- single machine scheduling problem
- single machine
- precedence relations
- sequence dependent setup times
- branch and bound algorithm
- shared memory
- vertex cover
- parallel computing
- setup times
- series parallel
- completion times
- approximation algorithms
- flowshop
- partially ordered
- processing times
- partial order
- scheduling jobs
- release times
- np hard
- partially ordered sets
- unit length
- lower bound
- identical parallel machines
- total weighted tardiness
- single server
- global constraints
- parallel algorithm
- tabu search
- special case