Scheduling Relaxed Loop-Free Updates Within Tight Lower Bounds in SDNs.
Hao ZhouXiaofeng GaoJiaqi ZhengGuihai ChenPublished in: IEEE/ACM Trans. Netw. (2020)
Keyphrases
- lower bound
- upper bound
- optimal solution
- branch and bound algorithm
- scheduling problem
- branch and bound
- np hard
- worst case
- scheduling algorithm
- precedence constraints
- objective function
- resource allocation
- lower and upper bounds
- lower bounding
- quadratic assignment problem
- round robin
- flexible manufacturing systems
- update operations
- real time database systems
- feedback loop
- linear programming relaxation
- upper and lower bounds
- resource constraints
- sample complexity
- optimal cost
- information systems
- randomly generated problems
- parallel machines
- search space
- database systems