Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective.
Bin JiDezhi ZhangSamson S. YuBinqiao ZhangPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- graph theory
- multi commodity
- network flow problem
- scheduling problem
- complex networks
- np hard
- combinatorial optimization
- social network analysis
- graph theoretical
- facility location
- network flow
- minimal cost
- heuristic solution
- computer networks
- network design
- max min
- network design problem
- minimum cost
- mixed integer
- communication networks
- tabu search
- transportation networks
- neural network
- social networks
- genetic algorithm