NPSCS: Non-Preemptive Stochastic Coflow Scheduling With Time-Indexed LP Relaxation.
Ruijiu MaoVaneet AggarwalPublished in: IEEE Trans. Netw. Serv. Manag. (2021)
Keyphrases
- lp relaxation
- scheduling problem
- scheduling algorithm
- linear programming
- linear program
- message passing
- feasible solution
- integer programming
- np hard
- optimal solution
- single machine
- knapsack problem
- energy minimization
- tabu search
- lower bound
- global constraints
- integer program
- maximum a posteriori
- valid inequalities
- processing times
- column generation
- objective function
- particle swarm optimization
- approximate solutions