Makespan-minimization workflow scheduling for complex networks with social groups in edge computing.
Jin SunLu YinMinhui ZouYi ZhangTianqi ZhangJunlong ZhouPublished in: J. Syst. Archit. (2020)
Keyphrases
- complex networks
- makespan minimization
- parallel machines
- scheduling problem
- social groups
- release dates
- social networks
- job shop scheduling problem
- flowshop
- processing times
- sequence dependent setup times
- community detection
- single machine
- setup times
- total weighted tardiness
- terrorist networks
- network analysis
- social network analysis
- social sciences
- graph theory
- community structure
- precedence constraints
- link prediction
- information theoretic concepts
- single machine scheduling problem
- network structure
- job shop
- np hard
- special case
- biological networks
- polynomially solvable
- real world networks
- scheduling algorithm
- weighted graph
- tabu search
- itemsets
- polynomial time approximation
- simulated annealing