Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints.
Spyros A. ReveliotisTheologos BountourelisPublished in: Discret. Event Dyn. Syst. (2011)
Keyphrases
- flow control
- precedence constraints
- scheduling problem
- low bandwidth
- branch and bound algorithm
- worst case
- optimal solution
- approximation algorithms
- state dependent
- high bandwidth
- network structure
- partial order
- particle swarm optimization
- objective function
- parallel machines
- partially ordered
- dynamic programming
- np hard