Approximate linear programming for networks: average cost bounds

DOI10.1016/j.cor.2015.04.014zbMath1349.90235OpenAlexW2466174699MaRDI QIDQ342031

Michael H. Veatch

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.014

zbMATH Keywords

linear programmingqueueing networkapproximate dynamic programming

Mathematics Subject Classification ID

Linear programming (90C05) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Related Items

Queueing Network Controls via Deep Reinforcement Learning

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized polynomial approximations in Markovian decision processes
• New linear program performance bounds for queueing networks
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
• Value iteration and optimization of multiclass queueing networks
• Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
• Dynamic safety-stocks for asymptotic optimality in stochastic networks
• Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback Regulation
• The Complexity of Optimal Queuing Network Control
• Information Relaxations and Duality in Stochastic Dynamic Programs
• Optimal control of two interacting service stations
• Pathwise Stochastic Optimal Control
• The Linear Programming Approach to Approximate Dynamic Programming
• Random Yield, Rework and Scrap in a Multistage Batch Manufacturing Environment
• Performance bounds for queueing networks and scheduling policies
• Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
• Approximate Dynamic Programming via a Smoothed Linear Program
• Computational Performance Bounds for Markov Chains With Applications
• Comparing LP Bounds for Queueing Networks
• Approximate Linear Programming for Average Cost MDPs
• Target-Pursuing Scheduling and Routing Policies for Multiclass Queueing Networks
• Approximate Dynamic Programming
• Neuro-Dynamic Programming: An Overview and Recent Results
• Control Techniques for Complex Networks
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming