Scheduling dependent coflows to minimize the total weighted job completion time in datacenters.
Bingchuan TianChen TianBingquan WangBo LiZehao HeHaipeng DaiKexin LiuWanchun DouGuihai ChenPublished in: Comput. Networks (2019)
Keyphrases
- completion times
- scheduling problem
- shortest processing time
- identical machines
- batch processing
- job scheduling
- identical parallel machines
- job shop
- release dates
- processing times
- single machine
- maximum lateness
- scheduling jobs
- deteriorating jobs
- single machine scheduling problem
- flowshop
- weighted sum
- release times
- batch processing machines
- round robin
- dynamic scheduling
- job shop scheduling
- precedence constraints
- scheduling algorithm
- website
- scheduling decisions
- np hard
- production scheduling
- container terminal
- sequence dependent setup times
- setup times
- data sets
- parallel machines
- combinatorial optimization
- resource allocation
- tabu search
- neural network