Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints

DOI10.1007/s10626-011-0112-0zbMath1236.49082MaRDI QIDQ763409

Theologos Bountourelis, Spyros A. Reveliotis

Publication date: 9 March 2012

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-011-0112-0

zbMATH Keywords

mixed integer programming; complexity analysis; optimal flow control; hybrid optimal control with controlled switching

Mathematics Subject Classification ID

90C11: Mixed integer programming

49N90: Applications of optimal control and differential games

49J30: Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.)

65Y20: Complexity and performance of numerical algorithms

93A15: Large-scale systems

Related Items

Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Ergodicity of stochastic processes describing the operation of open queueing networks
• Efficient PAC learning for episodic tasks with acyclic state spaces
• A unified framework for hybrid control: model and optimal control theory
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Control Techniques for Complex Networks
• Stability conditions for multiclass fluid queueing networks