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

DOI10.1007/S10626-011-0112-0MaRDI QIDQ763409zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complexity analysishybrid optimal control with controlled switchingmixed integer programmingoptimal flow control

Mathematics Subject Classification ID

Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Applications of optimal control and differential games (49N90) Complexity and performance of numerical algorithms (65Y20) Mixed integer programming (90C11) Large-scale systems (93A15)

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

Cites work

• A survey of dynamic network flows
• 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
• Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
• Efficient PAC learning for episodic tasks with acyclic state spaces
• Ergodicity of stochastic processes describing the operation of open queueing networks
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 728195 (Why is no real title available?)
• scientific article; zbMATH DE number 786514 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
• Stability conditions for multiclass fluid queueing networks

Cited in

(2)

• scientific article; zbMATH DE number 5582232 (Why is no real title available?)
• Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements

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)