Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints
DOI10.1007/S10626-011-0112-0zbMATH Open1236.49082OpenAlexW2087552721MaRDI QIDQ763409FDOQ763409
Authors: Theologos Bountourelis, Spyros 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
Recommendations
- Optimal control of dynamic routing in networks with randomly perturbed flows
- Combined Competitive Flow Control and Routing in Networks with Hard Side Constraints
- scientific article; zbMATH DE number 3869031
- Optimal control of input flow in heavy traffic on the network
- Optimal hop-by-hop flow control in computer networks
- scientific article; zbMATH DE number 2206640
- scientific article; zbMATH DE number 3904298
- scientific article; zbMATH DE number 5582232
- Optimal flow control of multi server time sharing queueing network with priority
- scientific article; zbMATH DE number 5953671
mixed integer programmingcomplexity analysisoptimal flow controlhybrid optimal control with controlled switching
Complexity and performance of numerical algorithms (65Y20) Mixed integer programming (90C11) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Applications of optimal control and differential games (49N90) Large-scale systems (93A15)
Cites Work
- Title not available (Why is that?)
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- A unified framework for hybrid control: model and optimal control theory
- Control Techniques for Complex Networks
- Ergodicity of stochastic processes describing the operation of open queueing networks
- Title not available (Why is that?)
- A survey of dynamic network flows
- Title not available (Why is that?)
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
- Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
- Title not available (Why is that?)
- Efficient PAC learning for episodic tasks with acyclic state spaces
- Stability conditions for multiclass fluid queueing networks
- Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
Cited In (2)
This page was built for publication: Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763409)
