Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints
Publication:763409
DOI10.1007/s10626-011-0112-0zbMath1236.49082OpenAlexW2087552721MaRDI 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
mixed integer programmingcomplexity analysisoptimal flow controlhybrid optimal control with controlled switching
Mixed integer programming (90C11) Applications of optimal control and differential games (49N90) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Complexity and performance of numerical algorithms (65Y20) Large-scale systems (93A15)
Related Items (1)
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
This page was built for publication: Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints
